/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:07:53,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:07:53,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:07:53,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:07:53,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:07:53,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:07:53,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:07:53,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:07:53,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:07:53,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:07:53,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:07:53,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:07:53,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:07:53,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:07:53,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:07:53,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:07:53,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:07:53,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:07:53,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:07:53,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:07:53,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:07:53,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:07:53,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:07:53,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:07:53,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:07:53,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:07:53,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:07:53,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:07:53,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:07:53,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:07:53,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:07:53,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:07:53,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:07:53,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:07:53,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:07:53,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:07:53,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:07:53,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:07:53,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:07:53,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:07:53,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:07:53,906 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:07:53,920 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:07:53,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:07:53,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:07:53,921 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:07:53,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:07:53,922 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:07:53,922 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:07:53,922 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:07:53,922 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:07:53,922 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:07:53,923 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:07:53,923 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:07:53,923 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:07:53,923 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:07:53,923 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:07:53,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:07:53,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:07:53,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:07:53,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:07:53,924 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:07:53,925 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:07:53,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:07:53,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:07:53,925 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:07:53,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:07:53,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:07:53,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:07:53,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:07:53,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:07:54,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:07:54,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:07:54,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:07:54,105 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:07:54,106 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:07:54,107 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:07:54,206 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_uWNEL3/tmp/f18bd45d4916410f8d7a02dd374b9494/FLAGea0eeb832 [2020-07-01 11:07:54,555 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:07:54,556 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:07:54,556 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 11:07:54,564 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_uWNEL3/tmp/f18bd45d4916410f8d7a02dd374b9494/FLAGea0eeb832 [2020-07-01 11:07:54,963 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_uWNEL3/tmp/f18bd45d4916410f8d7a02dd374b9494 [2020-07-01 11:07:54,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:07:54,976 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:07:54,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:07:54,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:07:54,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:07:54,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:07:54" (1/1) ... [2020-07-01 11:07:54,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329369cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:54, skipping insertion in model container [2020-07-01 11:07:54,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:07:54" (1/1) ... [2020-07-01 11:07:54,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:07:55,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:07:55,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:07:55,249 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:07:55,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:07:55,282 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:07:55,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55 WrapperNode [2020-07-01 11:07:55,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:07:55,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:07:55,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:07:55,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:07:55,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:07:55,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:07:55,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:07:55,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:07:55,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:07:55,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:07:55,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:07:55,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:07:55,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:07:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 11:07:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-01 11:07:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:07:55,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:07:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 11:07:55,696 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:07:55,696 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-01 11:07:55,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:07:55 BoogieIcfgContainer [2020-07-01 11:07:55,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:07:55,701 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:07:55,702 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:07:55,704 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:07:55,704 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:07:55" (1/1) ... [2020-07-01 11:07:55,723 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 48 edges [2020-07-01 11:07:55,724 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:07:55,725 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:07:55,726 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:07:55,726 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:07:55,728 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:07:55,729 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:07:55,729 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:07:55,755 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:07:55,784 INFO L200 BlockEncoder]: SBE split 19 edges [2020-07-01 11:07:55,789 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 11:07:55,791 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:07:55,836 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding [2020-07-01 11:07:55,838 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 11:07:55,840 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:07:55,840 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:07:55,841 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:07:55,841 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:07:55,841 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 53 edges [2020-07-01 11:07:55,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:07:55 BasicIcfg [2020-07-01 11:07:55,842 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:07:55,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:07:55,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:07:55,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:07:55,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:07:54" (1/4) ... [2020-07-01 11:07:55,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4119f2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:07:55, skipping insertion in model container [2020-07-01 11:07:55,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (2/4) ... [2020-07-01 11:07:55,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4119f2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:07:55, skipping insertion in model container [2020-07-01 11:07:55,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:07:55" (3/4) ... [2020-07-01 11:07:55,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4119f2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:07:55, skipping insertion in model container [2020-07-01 11:07:55,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:07:55" (4/4) ... [2020-07-01 11:07:55,851 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:07:55,861 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:07:55,869 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 11:07:55,882 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 11:07:55,906 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:07:55,906 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:07:55,906 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:07:55,906 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:07:55,906 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:07:55,907 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:07:55,907 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:07:55,907 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:07:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-01 11:07:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:07:55,928 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:55,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:07:55,929 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:55,935 INFO L82 PathProgramCache]: Analyzing trace with hash 6584673, now seen corresponding path program 1 times [2020-07-01 11:07:55,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:55,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682661613] [2020-07-01 11:07:55,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:56,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682661613] [2020-07-01 11:07:56,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:56,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:07:56,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609056688] [2020-07-01 11:07:56,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:07:56,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:07:56,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:07:56,126 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-07-01 11:07:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:56,258 INFO L93 Difference]: Finished difference Result 30 states and 53 transitions. [2020-07-01 11:07:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:07:56,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:07:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:56,274 INFO L225 Difference]: With dead ends: 30 [2020-07-01 11:07:56,274 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 11:07:56,277 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:07:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 11:07:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 11:07:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 11:07:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. [2020-07-01 11:07:56,316 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 4 [2020-07-01 11:07:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:56,317 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. [2020-07-01 11:07:56,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:07:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. [2020-07-01 11:07:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:07:56,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:56,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:07:56,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 11:07:56,319 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:56,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 6584675, now seen corresponding path program 1 times [2020-07-01 11:07:56,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:56,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76870461] [2020-07-01 11:07:56,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:56,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76870461] [2020-07-01 11:07:56,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:56,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:07:56,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593484784] [2020-07-01 11:07:56,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:07:56,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:56,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:07:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:07:56,357 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. [2020-07-01 11:07:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:56,446 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions. [2020-07-01 11:07:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:07:56,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:07:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:56,448 INFO L225 Difference]: With dead ends: 30 [2020-07-01 11:07:56,448 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 11:07:56,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:07:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 11:07:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 11:07:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 11:07:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2020-07-01 11:07:56,455 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 4 [2020-07-01 11:07:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:56,455 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 47 transitions. [2020-07-01 11:07:56,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:07:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions. [2020-07-01 11:07:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:07:56,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:56,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:07:56,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 11:07:56,456 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash 6584676, now seen corresponding path program 1 times [2020-07-01 11:07:56,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:56,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650596733] [2020-07-01 11:07:56,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:56,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650596733] [2020-07-01 11:07:56,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:56,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:07:56,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32820978] [2020-07-01 11:07:56,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:07:56,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:07:56,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:07:56,488 INFO L87 Difference]: Start difference. First operand 28 states and 47 transitions. Second operand 4 states. [2020-07-01 11:07:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:56,568 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-07-01 11:07:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:07:56,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 11:07:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:56,570 INFO L225 Difference]: With dead ends: 28 [2020-07-01 11:07:56,570 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 11:07:56,570 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:07:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 11:07:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 11:07:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 11:07:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2020-07-01 11:07:56,575 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 4 [2020-07-01 11:07:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:56,576 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2020-07-01 11:07:56,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:07:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-07-01 11:07:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 11:07:56,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:56,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:56,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 11:07:56,577 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:56,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash -549407375, now seen corresponding path program 1 times [2020-07-01 11:07:56,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:56,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696792183] [2020-07-01 11:07:56,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:56,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696792183] [2020-07-01 11:07:56,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:56,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 11:07:56,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313497110] [2020-07-01 11:07:56,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 11:07:56,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:07:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:07:56,669 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 6 states. [2020-07-01 11:07:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:57,034 INFO L93 Difference]: Finished difference Result 80 states and 155 transitions. [2020-07-01 11:07:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 11:07:57,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 11:07:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:57,037 INFO L225 Difference]: With dead ends: 80 [2020-07-01 11:07:57,037 INFO L226 Difference]: Without dead ends: 77 [2020-07-01 11:07:57,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-07-01 11:07:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-01 11:07:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 23. [2020-07-01 11:07:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 11:07:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. [2020-07-01 11:07:57,045 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 8 [2020-07-01 11:07:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:57,045 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 39 transitions. [2020-07-01 11:07:57,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 11:07:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2020-07-01 11:07:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 11:07:57,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:57,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:57,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 11:07:57,047 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash -549407374, now seen corresponding path program 1 times [2020-07-01 11:07:57,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:57,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202343295] [2020-07-01 11:07:57,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:57,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202343295] [2020-07-01 11:07:57,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:57,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:07:57,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379685599] [2020-07-01 11:07:57,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:07:57,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:57,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:07:57,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:07:57,105 INFO L87 Difference]: Start difference. First operand 23 states and 39 transitions. Second operand 5 states. [2020-07-01 11:07:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:57,238 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. [2020-07-01 11:07:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:07:57,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 11:07:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:57,239 INFO L225 Difference]: With dead ends: 42 [2020-07-01 11:07:57,239 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 11:07:57,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:07:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 11:07:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2020-07-01 11:07:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 11:07:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2020-07-01 11:07:57,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 60 transitions. Word has length 8 [2020-07-01 11:07:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:57,248 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 60 transitions. [2020-07-01 11:07:57,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:07:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 60 transitions. [2020-07-01 11:07:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 11:07:57,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:57,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:57,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 11:07:57,249 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash -549407373, now seen corresponding path program 1 times [2020-07-01 11:07:57,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:57,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858191917] [2020-07-01 11:07:57,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:57,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858191917] [2020-07-01 11:07:57,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:57,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:07:57,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140569771] [2020-07-01 11:07:57,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 11:07:57,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:57,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:07:57,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:07:57,336 INFO L87 Difference]: Start difference. First operand 31 states and 60 transitions. Second operand 7 states. [2020-07-01 11:07:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:57,798 INFO L93 Difference]: Finished difference Result 122 states and 223 transitions. [2020-07-01 11:07:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:07:57,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 11:07:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:57,800 INFO L225 Difference]: With dead ends: 122 [2020-07-01 11:07:57,800 INFO L226 Difference]: Without dead ends: 119 [2020-07-01 11:07:57,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-07-01 11:07:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-01 11:07:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 43. [2020-07-01 11:07:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 11:07:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 84 transitions. [2020-07-01 11:07:57,810 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 84 transitions. Word has length 8 [2020-07-01 11:07:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:57,811 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 84 transitions. [2020-07-01 11:07:57,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 11:07:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 84 transitions. [2020-07-01 11:07:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 11:07:57,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:57,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:57,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 11:07:57,812 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash -520778222, now seen corresponding path program 1 times [2020-07-01 11:07:57,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:57,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869026928] [2020-07-01 11:07:57,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:57,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869026928] [2020-07-01 11:07:57,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:57,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:07:57,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351058727] [2020-07-01 11:07:57,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 11:07:57,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:57,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:07:57,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:07:57,892 INFO L87 Difference]: Start difference. First operand 43 states and 84 transitions. Second operand 7 states. [2020-07-01 11:07:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:58,050 INFO L93 Difference]: Finished difference Result 51 states and 88 transitions. [2020-07-01 11:07:58,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:07:58,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 11:07:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:58,052 INFO L225 Difference]: With dead ends: 51 [2020-07-01 11:07:58,052 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 11:07:58,052 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:07:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 11:07:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-07-01 11:07:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 11:07:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2020-07-01 11:07:58,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 57 transitions. Word has length 8 [2020-07-01 11:07:58,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:58,058 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 57 transitions. [2020-07-01 11:07:58,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 11:07:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 57 transitions. [2020-07-01 11:07:58,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:07:58,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:58,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:58,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 11:07:58,059 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 974409270, now seen corresponding path program 1 times [2020-07-01 11:07:58,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:58,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301457672] [2020-07-01 11:07:58,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:58,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301457672] [2020-07-01 11:07:58,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:58,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:07:58,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059708081] [2020-07-01 11:07:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:07:58,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:07:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:07:58,105 INFO L87 Difference]: Start difference. First operand 31 states and 57 transitions. Second operand 4 states. [2020-07-01 11:07:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:58,170 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2020-07-01 11:07:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:07:58,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 11:07:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:58,171 INFO L225 Difference]: With dead ends: 31 [2020-07-01 11:07:58,171 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 11:07:58,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:07:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 11:07:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 11:07:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 11:07:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2020-07-01 11:07:58,176 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 12 [2020-07-01 11:07:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:58,177 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. [2020-07-01 11:07:58,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:07:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. [2020-07-01 11:07:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:07:58,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:58,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:58,178 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 11:07:58,178 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash 974409272, now seen corresponding path program 1 times [2020-07-01 11:07:58,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:58,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201355747] [2020-07-01 11:07:58,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:58,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201355747] [2020-07-01 11:07:58,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:58,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:07:58,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862545154] [2020-07-01 11:07:58,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:07:58,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:58,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:07:58,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:07:58,220 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 4 states. [2020-07-01 11:07:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:58,281 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2020-07-01 11:07:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:07:58,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 11:07:58,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:58,282 INFO L225 Difference]: With dead ends: 34 [2020-07-01 11:07:58,282 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 11:07:58,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:07:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 11:07:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-01 11:07:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 11:07:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 51 transitions. [2020-07-01 11:07:58,287 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 51 transitions. Word has length 12 [2020-07-01 11:07:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:58,288 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 51 transitions. [2020-07-01 11:07:58,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:07:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 51 transitions. [2020-07-01 11:07:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:07:58,289 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:58,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:58,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 11:07:58,289 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash 974409273, now seen corresponding path program 1 times [2020-07-01 11:07:58,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:58,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741568479] [2020-07-01 11:07:58,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:58,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741568479] [2020-07-01 11:07:58,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:58,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:07:58,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020639382] [2020-07-01 11:07:58,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:07:58,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:58,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:07:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:07:58,354 INFO L87 Difference]: Start difference. First operand 30 states and 51 transitions. Second operand 5 states. [2020-07-01 11:07:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:58,509 INFO L93 Difference]: Finished difference Result 59 states and 97 transitions. [2020-07-01 11:07:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:07:58,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-01 11:07:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:58,510 INFO L225 Difference]: With dead ends: 59 [2020-07-01 11:07:58,510 INFO L226 Difference]: Without dead ends: 55 [2020-07-01 11:07:58,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:07:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-01 11:07:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2020-07-01 11:07:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 11:07:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-07-01 11:07:58,517 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 12 [2020-07-01 11:07:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:58,517 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-07-01 11:07:58,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:07:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-07-01 11:07:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:07:58,518 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:58,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:58,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 11:07:58,518 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:58,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:58,519 INFO L82 PathProgramCache]: Analyzing trace with hash 974410741, now seen corresponding path program 1 times [2020-07-01 11:07:58,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:58,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137183649] [2020-07-01 11:07:58,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:58,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137183649] [2020-07-01 11:07:58,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:58,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:07:58,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149376080] [2020-07-01 11:07:58,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:07:58,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:07:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:07:58,552 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. [2020-07-01 11:07:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:58,605 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2020-07-01 11:07:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:07:58,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-01 11:07:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:58,606 INFO L225 Difference]: With dead ends: 63 [2020-07-01 11:07:58,606 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 11:07:58,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:07:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 11:07:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2020-07-01 11:07:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 11:07:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 69 transitions. [2020-07-01 11:07:58,612 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 69 transitions. Word has length 12 [2020-07-01 11:07:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:58,613 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 69 transitions. [2020-07-01 11:07:58,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:07:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 69 transitions. [2020-07-01 11:07:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:07:58,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:58,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:58,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 11:07:58,614 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash 974470323, now seen corresponding path program 1 times [2020-07-01 11:07:58,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:58,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764191557] [2020-07-01 11:07:58,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:58,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764191557] [2020-07-01 11:07:58,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:58,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:07:58,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778948601] [2020-07-01 11:07:58,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:07:58,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:07:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:07:58,647 INFO L87 Difference]: Start difference. First operand 42 states and 69 transitions. Second operand 3 states. [2020-07-01 11:07:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:58,693 INFO L93 Difference]: Finished difference Result 68 states and 111 transitions. [2020-07-01 11:07:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:07:58,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-01 11:07:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:58,694 INFO L225 Difference]: With dead ends: 68 [2020-07-01 11:07:58,694 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 11:07:58,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:07:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 11:07:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 11:07:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 11:07:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2020-07-01 11:07:58,700 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 12 [2020-07-01 11:07:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:58,701 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2020-07-01 11:07:58,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:07:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2020-07-01 11:07:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:07:58,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:58,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:58,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 11:07:58,702 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1205396439, now seen corresponding path program 1 times [2020-07-01 11:07:58,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:58,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310854645] [2020-07-01 11:07:58,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:58,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310854645] [2020-07-01 11:07:58,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:58,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:07:58,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687969782] [2020-07-01 11:07:58,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:07:58,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:07:58,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:07:58,750 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand 5 states. [2020-07-01 11:07:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:58,830 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2020-07-01 11:07:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:07:58,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-01 11:07:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:58,831 INFO L225 Difference]: With dead ends: 44 [2020-07-01 11:07:58,831 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 11:07:58,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:07:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 11:07:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2020-07-01 11:07:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 11:07:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-07-01 11:07:58,835 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 12 [2020-07-01 11:07:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:58,836 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-07-01 11:07:58,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:07:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2020-07-01 11:07:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 11:07:58,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:58,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:58,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 11:07:58,837 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1059563785, now seen corresponding path program 1 times [2020-07-01 11:07:58,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:58,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885539826] [2020-07-01 11:07:58,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:58,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885539826] [2020-07-01 11:07:58,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355752606] [2020-07-01 11:07:58,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:07:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:58,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:07:58,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:07:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:58,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:07:58,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 11:07:58,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241516041] [2020-07-01 11:07:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:07:58,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:07:58,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:07:58,984 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 4 states. [2020-07-01 11:07:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:59,044 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-07-01 11:07:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:07:59,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-01 11:07:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:59,046 INFO L225 Difference]: With dead ends: 33 [2020-07-01 11:07:59,046 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 11:07:59,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:07:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 11:07:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-01 11:07:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 11:07:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-07-01 11:07:59,050 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 15 [2020-07-01 11:07:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:59,050 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-07-01 11:07:59,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:07:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-07-01 11:07:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 11:07:59,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:59,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:59,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 11:07:59,252 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:59,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1059563784, now seen corresponding path program 1 times [2020-07-01 11:07:59,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:59,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421002663] [2020-07-01 11:07:59,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:59,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421002663] [2020-07-01 11:07:59,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:59,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-01 11:07:59,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967690845] [2020-07-01 11:07:59,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 11:07:59,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:59,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 11:07:59,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-01 11:07:59,365 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 9 states. [2020-07-01 11:07:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:59,665 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2020-07-01 11:07:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 11:07:59,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-01 11:07:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:59,666 INFO L225 Difference]: With dead ends: 56 [2020-07-01 11:07:59,666 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 11:07:59,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-07-01 11:07:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 11:07:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2020-07-01 11:07:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 11:07:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-07-01 11:07:59,671 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 15 [2020-07-01 11:07:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:59,671 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-07-01 11:07:59,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 11:07:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-07-01 11:07:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 11:07:59,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:59,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:59,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 11:07:59,672 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 253985544, now seen corresponding path program 1 times [2020-07-01 11:07:59,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:59,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485194809] [2020-07-01 11:07:59,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:07:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:07:59,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485194809] [2020-07-01 11:07:59,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:07:59,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 11:07:59,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142320575] [2020-07-01 11:07:59,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 11:07:59,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:07:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:07:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:07:59,792 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 8 states. [2020-07-01 11:07:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:07:59,939 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2020-07-01 11:07:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:07:59,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-01 11:07:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:07:59,940 INFO L225 Difference]: With dead ends: 60 [2020-07-01 11:07:59,940 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 11:07:59,940 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:07:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 11:07:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2020-07-01 11:07:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 11:07:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-07-01 11:07:59,945 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 15 [2020-07-01 11:07:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:07:59,945 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-01 11:07:59,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 11:07:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-01 11:07:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 11:07:59,946 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:07:59,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:07:59,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 11:07:59,946 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:07:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash -39417463, now seen corresponding path program 1 times [2020-07-01 11:07:59,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:59,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750221823] [2020-07-01 11:07:59,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:00,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750221823] [2020-07-01 11:08:00,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:08:00,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 11:08:00,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169060621] [2020-07-01 11:08:00,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 11:08:00,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:08:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:08:00,042 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 8 states. [2020-07-01 11:08:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:00,205 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2020-07-01 11:08:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:08:00,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-01 11:08:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:00,206 INFO L225 Difference]: With dead ends: 57 [2020-07-01 11:08:00,206 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 11:08:00,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:08:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 11:08:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-01 11:08:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 11:08:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-07-01 11:08:00,210 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2020-07-01 11:08:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:00,210 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-07-01 11:08:00,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 11:08:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-07-01 11:08:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 11:08:00,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:00,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:00,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 11:08:00,212 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1271814397, now seen corresponding path program 1 times [2020-07-01 11:08:00,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:00,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493102901] [2020-07-01 11:08:00,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:00,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493102901] [2020-07-01 11:08:00,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431229092] [2020-07-01 11:08:00,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:00,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 11:08:00,477 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:00,512 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:00,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 11:08:00,560 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:00,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 11:08:00,571 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:00,595 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:00,599 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 11:08:00,599 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2020-07-01 11:08:00,749 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2020-07-01 11:08:00,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:00,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-07-01 11:08:00,778 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:00,795 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:00,796 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:00,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:32 [2020-07-01 11:08:00,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:00,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 11:08:00,853 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:00,867 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:00,870 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:00,870 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:39 [2020-07-01 11:08:00,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:00,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:00,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2020-07-01 11:08:00,934 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:00,934 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:00,951 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:00,952 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:00,955 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:00,956 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:31 [2020-07-01 11:08:01,007 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:01,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:01,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-01 11:08:01,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199256385] [2020-07-01 11:08:01,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:08:01,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:01,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:08:01,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:08:01,067 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 17 states. [2020-07-01 11:08:01,616 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2020-07-01 11:08:02,334 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-07-01 11:08:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:02,951 INFO L93 Difference]: Finished difference Result 124 states and 169 transitions. [2020-07-01 11:08:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-01 11:08:02,952 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-07-01 11:08:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:02,953 INFO L225 Difference]: With dead ends: 124 [2020-07-01 11:08:02,953 INFO L226 Difference]: Without dead ends: 121 [2020-07-01 11:08:02,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=314, Invalid=1092, Unknown=0, NotChecked=0, Total=1406 [2020-07-01 11:08:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-07-01 11:08:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 39. [2020-07-01 11:08:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 11:08:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2020-07-01 11:08:02,961 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 15 [2020-07-01 11:08:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:02,962 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2020-07-01 11:08:02,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:08:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-01 11:08:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 11:08:02,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:02,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:03,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 11:08:03,164 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:03,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:03,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1565217404, now seen corresponding path program 1 times [2020-07-01 11:08:03,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:03,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856958373] [2020-07-01 11:08:03,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:03,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856958373] [2020-07-01 11:08:03,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226917616] [2020-07-01 11:08:03,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:03,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-01 11:08:03,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:03,414 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_29|]} [2020-07-01 11:08:03,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:03,419 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:03,424 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,450 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2020-07-01 11:08:03,458 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2020-07-01 11:08:03,464 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,485 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,485 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:08:03,486 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:35 [2020-07-01 11:08:03,522 INFO L296 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-07-01 11:08:03,523 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,524 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:08:03,535 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:08:03,541 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,566 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,568 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-01 11:08:03,568 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2020-07-01 11:08:03,617 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:03,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2020-07-01 11:08:03,649 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:03,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2020-07-01 11:08:03,666 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,704 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:08:03,717 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,727 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:08:03,728 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,755 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,757 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-01 11:08:03,757 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:67 [2020-07-01 11:08:03,811 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,814 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,817 INFO L296 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-07-01 11:08:03,818 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,823 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,830 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 11:08:03,846 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 11:08:03,853 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:03,880 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,882 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2020-07-01 11:08:03,883 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:89, output treesize:81 [2020-07-01 11:08:03,942 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:03,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 11:08:03,970 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:03,970 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:03,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:03,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2020-07-01 11:08:03,983 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:04,007 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:04,008 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:04,010 INFO L539 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:08:04,010 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:95, output treesize:44 [2020-07-01 11:08:04,071 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:04,071 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:04,104 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:04,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:04,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-01 11:08:04,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604985356] [2020-07-01 11:08:04,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:08:04,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:04,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:08:04,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:08:04,138 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 17 states. [2020-07-01 11:08:04,533 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-07-01 11:08:19,851 WARN L192 SmtUtils]: Spent 15.26 s on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2020-07-01 11:08:25,381 WARN L192 SmtUtils]: Spent 5.44 s on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2020-07-01 11:08:35,635 WARN L192 SmtUtils]: Spent 10.21 s on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2020-07-01 11:08:35,869 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2020-07-01 11:08:36,120 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2020-07-01 11:08:36,402 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-07-01 11:08:36,585 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-07-01 11:08:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:36,618 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2020-07-01 11:08:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 11:08:36,619 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-07-01 11:08:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:36,619 INFO L225 Difference]: With dead ends: 56 [2020-07-01 11:08:36,619 INFO L226 Difference]: Without dead ends: 55 [2020-07-01 11:08:36,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2020-07-01 11:08:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-01 11:08:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 29. [2020-07-01 11:08:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 11:08:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-07-01 11:08:36,626 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2020-07-01 11:08:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:36,626 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-07-01 11:08:36,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:08:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-07-01 11:08:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 11:08:36,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:36,627 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:36,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:36,828 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1662121928, now seen corresponding path program 1 times [2020-07-01 11:08:36,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:36,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619954329] [2020-07-01 11:08:36,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:36,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619954329] [2020-07-01 11:08:36,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922069168] [2020-07-01 11:08:36,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:36,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:08:36,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:36,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:08:36,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 11:08:36,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912366857] [2020-07-01 11:08:36,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:08:36,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:36,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:08:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:08:36,934 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 4 states. [2020-07-01 11:08:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:36,985 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-01 11:08:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:08:36,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-01 11:08:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:36,986 INFO L225 Difference]: With dead ends: 31 [2020-07-01 11:08:36,986 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 11:08:36,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:08:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 11:08:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 11:08:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 11:08:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2020-07-01 11:08:36,992 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 19 [2020-07-01 11:08:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:36,992 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-07-01 11:08:36,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:08:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2020-07-01 11:08:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 11:08:36,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:36,993 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:37,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:37,194 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1662121929, now seen corresponding path program 1 times [2020-07-01 11:08:37,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:37,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548831574] [2020-07-01 11:08:37,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:37,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548831574] [2020-07-01 11:08:37,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032600544] [2020-07-01 11:08:37,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:37,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 11:08:37,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:37,454 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:37,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 11:08:37,467 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:37,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 11:08:37,472 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:37,490 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:37,491 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 11:08:37,492 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 11:08:37,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:37,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2020-07-01 11:08:37,644 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:37,645 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:08:37,646 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-01 11:08:37,646 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 11:08:37,647 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:08:37,648 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 11:08:37,648 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:08:37,649 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 11:08:37,651 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:37,748 INFO L619 ElimStorePlain]: treesize reduction 13, result has 91.5 percent of original size [2020-07-01 11:08:37,750 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:37,751 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:37,751 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:37,752 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:08:37,753 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:47 [2020-07-01 11:08:37,808 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:37,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:37,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 11:08:37,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232429768] [2020-07-01 11:08:37,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:08:37,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:37,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:08:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:08:37,836 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 17 states. [2020-07-01 11:08:38,514 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-07-01 11:08:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:38,944 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-07-01 11:08:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-01 11:08:38,945 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2020-07-01 11:08:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:38,945 INFO L225 Difference]: With dead ends: 45 [2020-07-01 11:08:38,945 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 11:08:38,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2020-07-01 11:08:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 11:08:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2020-07-01 11:08:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 11:08:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2020-07-01 11:08:38,951 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 19 [2020-07-01 11:08:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:38,951 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2020-07-01 11:08:38,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:08:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-01 11:08:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 11:08:38,952 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:38,952 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:39,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-07-01 11:08:39,153 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash -405830808, now seen corresponding path program 2 times [2020-07-01 11:08:39,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:39,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861625484] [2020-07-01 11:08:39,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:39,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861625484] [2020-07-01 11:08:39,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427111020] [2020-07-01 11:08:39,384 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:39,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:08:39,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:08:39,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 11:08:39,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:39,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:39,436 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:39,442 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:39,442 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:39,442 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-01 11:08:39,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:08:39,463 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:39,468 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:39,468 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:39,468 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-07-01 11:08:39,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:39,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:08:39,492 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:39,500 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:39,501 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:39,501 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2020-07-01 11:08:39,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:39,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:08:39,536 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:39,547 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:39,548 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:39,549 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2020-07-01 11:08:39,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:39,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:39,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:08:39,613 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:39,613 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:39,626 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:39,627 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:39,627 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 [2020-07-01 11:08:39,655 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:08:39,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:39,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2020-07-01 11:08:39,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004118251] [2020-07-01 11:08:39,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:08:39,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:39,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:08:39,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:08:39,710 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 17 states. [2020-07-01 11:08:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:41,279 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2020-07-01 11:08:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-01 11:08:41,280 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-07-01 11:08:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:41,281 INFO L225 Difference]: With dead ends: 134 [2020-07-01 11:08:41,281 INFO L226 Difference]: Without dead ends: 133 [2020-07-01 11:08:41,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2020-07-01 11:08:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-01 11:08:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 78. [2020-07-01 11:08:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-01 11:08:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2020-07-01 11:08:41,294 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 22 [2020-07-01 11:08:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:41,294 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2020-07-01 11:08:41,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:08:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2020-07-01 11:08:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 11:08:41,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:41,295 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:41,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:41,496 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash -814655033, now seen corresponding path program 2 times [2020-07-01 11:08:41,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:41,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273325077] [2020-07-01 11:08:41,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:41,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273325077] [2020-07-01 11:08:41,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450193078] [2020-07-01 11:08:41,711 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:41,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:08:41,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:08:41,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-01 11:08:41,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:41,764 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_31|]} [2020-07-01 11:08:41,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:41,767 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,775 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2020-07-01 11:08:41,781 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,786 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,787 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,787 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-07-01 11:08:41,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:08:41,809 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,814 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,814 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,814 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-01 11:08:41,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:41,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:08:41,839 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,851 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:08:41,860 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,872 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,872 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,872 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-07-01 11:08:41,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:08:41,899 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,905 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,906 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:41,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-07-01 11:08:41,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:08:41,961 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:41,961 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:41,971 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:41,971 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:41,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-07-01 11:08:41,998 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:08:42,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:42,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-01 11:08:42,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556652673] [2020-07-01 11:08:42,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 11:08:42,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:42,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 11:08:42,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-07-01 11:08:42,020 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 15 states. [2020-07-01 11:08:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:43,118 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2020-07-01 11:08:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-01 11:08:43,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-07-01 11:08:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:43,119 INFO L225 Difference]: With dead ends: 104 [2020-07-01 11:08:43,119 INFO L226 Difference]: Without dead ends: 103 [2020-07-01 11:08:43,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2020-07-01 11:08:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-01 11:08:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 39. [2020-07-01 11:08:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 11:08:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-07-01 11:08:43,126 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2020-07-01 11:08:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:43,127 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-07-01 11:08:43,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 11:08:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-01 11:08:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-01 11:08:43,127 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:43,128 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:43,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:43,328 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:43,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:43,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1578034770, now seen corresponding path program 2 times [2020-07-01 11:08:43,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:43,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869224435] [2020-07-01 11:08:43,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:43,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869224435] [2020-07-01 11:08:43,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036263913] [2020-07-01 11:08:43,663 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:43,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:08:43,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:08:43,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 11:08:43,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:43,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:43,717 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:43,722 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:43,722 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:43,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:08:43,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:08:43,744 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:43,750 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:43,751 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:43,751 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 11:08:43,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:43,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 57 [2020-07-01 11:08:43,915 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:43,916 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:08:43,917 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-01 11:08:43,917 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 11:08:43,918 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:08:43,919 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 11:08:43,920 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:08:43,921 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:44,039 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-07-01 11:08:44,040 INFO L619 ElimStorePlain]: treesize reduction 37, result has 78.0 percent of original size [2020-07-01 11:08:44,041 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:08:44,042 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:08:44,043 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:44,044 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:44,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:47 [2020-07-01 11:08:44,099 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:08:44,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:44,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-01 11:08:44,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576363770] [2020-07-01 11:08:44,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 11:08:44,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 11:08:44,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-01 11:08:44,141 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 18 states. [2020-07-01 11:08:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:46,339 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-07-01 11:08:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-07-01 11:08:46,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-01 11:08:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:46,340 INFO L225 Difference]: With dead ends: 73 [2020-07-01 11:08:46,340 INFO L226 Difference]: Without dead ends: 67 [2020-07-01 11:08:46,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=645, Invalid=1905, Unknown=0, NotChecked=0, Total=2550 [2020-07-01 11:08:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-01 11:08:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2020-07-01 11:08:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 11:08:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-07-01 11:08:46,348 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2020-07-01 11:08:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:46,348 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-07-01 11:08:46,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 11:08:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2020-07-01 11:08:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-01 11:08:46,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:46,349 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:46,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-07-01 11:08:46,550 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:46,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:46,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1931536732, now seen corresponding path program 1 times [2020-07-01 11:08:46,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:46,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845289499] [2020-07-01 11:08:46,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 11:08:46,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845289499] [2020-07-01 11:08:46,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739916883] [2020-07-01 11:08:46,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:46,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 11:08:46,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:46,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:46,741 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:46,747 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:46,748 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:46,748 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-01 11:08:46,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:08:46,755 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:46,764 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:46,764 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:46,765 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-01 11:08:46,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:46,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:08:46,774 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:46,784 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:46,784 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:46,785 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2020-07-01 11:08:46,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:46,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:08:46,815 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:46,826 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:46,828 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:46,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 11:08:46,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:08:46,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:46,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:08:46,903 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:46,903 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:46,918 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:46,919 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:46,920 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2020-07-01 11:08:46,946 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 11:08:47,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:47,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-01 11:08:47,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148229412] [2020-07-01 11:08:47,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 11:08:47,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 11:08:47,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-01 11:08:47,015 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 15 states. [2020-07-01 11:08:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:47,715 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2020-07-01 11:08:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-01 11:08:47,716 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2020-07-01 11:08:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:47,717 INFO L225 Difference]: With dead ends: 156 [2020-07-01 11:08:47,717 INFO L226 Difference]: Without dead ends: 155 [2020-07-01 11:08:47,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2020-07-01 11:08:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-07-01 11:08:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 76. [2020-07-01 11:08:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-01 11:08:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2020-07-01 11:08:47,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 29 [2020-07-01 11:08:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:47,730 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2020-07-01 11:08:47,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 11:08:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2020-07-01 11:08:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-01 11:08:47,731 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:47,731 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:47,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:47,932 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash -969922715, now seen corresponding path program 1 times [2020-07-01 11:08:47,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:47,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452244404] [2020-07-01 11:08:47,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 11:08:48,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452244404] [2020-07-01 11:08:48,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591189730] [2020-07-01 11:08:48,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:48,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-01 11:08:48,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:48,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:48,115 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,121 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:48,124 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,129 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,129 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,130 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-07-01 11:08:48,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:08:48,148 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,153 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,153 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,154 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-01 11:08:48,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:08:48,165 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:48,165 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,172 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:08:48,175 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,181 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,181 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,182 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-07-01 11:08:48,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:08:48,203 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,210 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,210 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 11:08:48,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-07-01 11:08:48,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:08:48,262 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:48,263 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:48,273 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:48,274 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:48,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-07-01 11:08:48,299 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 11:08:48,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:48,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2020-07-01 11:08:48,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575357582] [2020-07-01 11:08:48,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 11:08:48,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 11:08:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-07-01 11:08:48,318 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 14 states. [2020-07-01 11:08:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:48,634 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2020-07-01 11:08:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:08:48,635 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-01 11:08:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:48,636 INFO L225 Difference]: With dead ends: 76 [2020-07-01 11:08:48,636 INFO L226 Difference]: Without dead ends: 75 [2020-07-01 11:08:48,636 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2020-07-01 11:08:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-01 11:08:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2020-07-01 11:08:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 11:08:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-01 11:08:48,643 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 29 [2020-07-01 11:08:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:48,643 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-01 11:08:48,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 11:08:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-01 11:08:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-01 11:08:48,644 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:08:48,644 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:48,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-07-01 11:08:48,845 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:08:48,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:48,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1112321770, now seen corresponding path program 1 times [2020-07-01 11:08:48,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:48,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958941123] [2020-07-01 11:08:48,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 11:08:48,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958941123] [2020-07-01 11:08:48,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849562430] [2020-07-01 11:08:48,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:08:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:49,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 11:08:49,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:08:49,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:08:49,036 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:49,040 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:49,040 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:49,041 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:08:49,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:08:49,045 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:08:49,047 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:49,047 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:49,047 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 11:08:49,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:49,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 53 [2020-07-01 11:08:49,136 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:49,136 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:08:49,137 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 11:08:49,138 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:08:49,138 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:08:49,139 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:08:49,140 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:08:49,183 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:08:49,184 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:49,185 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:49,185 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:08:49,186 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:49,187 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:49,187 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:08:49,188 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:08:49,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2020-07-01 11:08:49,230 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:08:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 11:08:49,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:08:49,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-07-01 11:08:49,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309722582] [2020-07-01 11:08:49,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 11:08:49,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:49,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 11:08:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-07-01 11:08:49,248 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 15 states. [2020-07-01 11:08:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:49,787 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-01 11:08:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 11:08:49,787 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2020-07-01 11:08:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:08:49,788 INFO L225 Difference]: With dead ends: 52 [2020-07-01 11:08:49,788 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 11:08:49,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2020-07-01 11:08:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 11:08:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 11:08:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 11:08:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 11:08:49,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2020-07-01 11:08:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:08:49,790 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:08:49,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 11:08:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:08:49,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:08:49,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-07-01 11:08:49,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 11:08:50,458 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 311 [2020-07-01 11:08:59,220 WARN L192 SmtUtils]: Spent 8.66 s on a formula simplification. DAG size of input: 299 DAG size of output: 138 [2020-07-01 11:08:59,729 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 43 [2020-07-01 11:08:59,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:08:59,733 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,733 INFO L268 CegarLoopResult]: For program point L30-2(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,733 INFO L268 CegarLoopResult]: For program point L30-3(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,733 INFO L268 CegarLoopResult]: For program point L30-4(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,733 INFO L268 CegarLoopResult]: For program point L30-5(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,733 INFO L268 CegarLoopResult]: For program point L30-7(lines 30 33) no Hoare annotation was computed. [2020-07-01 11:08:59,734 INFO L264 CegarLoopResult]: At program point L30-9(lines 30 33) the Hoare annotation is: (let ((.cse16 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret11.base|))) (.cse24 (select |#length| |ULTIMATE.start_main_#t~ret11.base|)) (.cse23 (select |#length| ULTIMATE.start_cstrcmp_~s2.base)) (.cse2 (select |#length| ULTIMATE.start_cstrcmp_~s1.base))) (let ((.cse0 (= ULTIMATE.start_cstrcmp_~s1.offset 0)) (.cse15 (<= 1 .cse2)) (.cse7 (= 0 ULTIMATE.start_cstrcmp_~s2.offset)) (.cse17 (<= 1 .cse23)) (.cse18 (<= 1 .cse24)) (.cse20 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse21 (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base)) (.cse1 (or (and (exists ((v_prenex_2 Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret11.base|) v_prenex_2 (- 1)))) (<= v_prenex_2 0) (<= |ULTIMATE.start_main_#t~ret11.offset| v_prenex_2))) .cse16 (< 1 .cse24)) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret11.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 (- 1)))) (<= |ULTIMATE.start_main_#t~ret11.offset| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 0))) .cse16 (= 1 .cse24)))) (.cse4 (= 0 |ULTIMATE.start_main_#t~ret11.offset|)) (.cse14 (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_cstrcmp_~s2.base))) (.cse6 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse13 (< 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse10 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse8 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (<= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (<= 0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s2.base) (- 1))))))) (.cse9 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret11.base|))) (.cse3 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (- 1)))) (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrcmp_~s1.base))))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrcmp_~s1.base))) (.cse12 (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base))) (.cse19 (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset))) (or (and .cse0 (exists ((v_prenex_5 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) v_prenex_5)) (<= ULTIMATE.start_cstrcmp_~s2.offset v_prenex_5) (<= (+ v_prenex_5 1) (select |#length| ULTIMATE.start_cstrcmp_~s2.base)))) .cse1 (or (and (< 1 .cse2) (exists ((v_prenex_2 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) (+ v_prenex_2 (select |#length| ULTIMATE.start_cstrcmp_~s1.base) (- 1)))) (<= v_prenex_2 0) (<= ULTIMATE.start_cstrcmp_~s1.offset v_prenex_2))) .cse3) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 (select |#length| ULTIMATE.start_cstrcmp_~s1.base) (- 1)))) (<= ULTIMATE.start_cstrcmp_~s1.offset v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 0))) (= .cse2 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse13 .cse14)) (and .cse0 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) ULTIMATE.start_cstrcmp_~s2.offset)) .cse4 .cse5 .cse15 .cse6 .cse7 .cse16 .cse17 .cse10 .cse18 .cse11 (<= .cse19 1) .cse12 .cse20) (and .cse0 .cse4 .cse5 (= 0 (select .cse21 ULTIMATE.start_cstrcmp_~s1.offset)) .cse15 .cse6 .cse7 .cse16 (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) |ULTIMATE.start_main_#t~ret11.offset|) 0) .cse17 .cse10 .cse18 .cse11 .cse12 .cse20) (let ((.cse22 (= 1 .cse19))) (and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) .cse2) (= (select .cse21 (+ .cse2 (- 1))) 0) .cse1 .cse4 (or (not .cse22) .cse14) .cse5 (<= 1 ULTIMATE.start_cstrcmp_~s2.offset) .cse6 (or (and .cse13 .cse10) .cse22) .cse8 .cse9 .cse3 (<= (+ ULTIMATE.start_cstrcmp_~s2.offset 1) .cse23) .cse11 .cse12 (<= 1 ULTIMATE.start_cstrcmp_~s1.offset)))))) [2020-07-01 11:08:59,734 INFO L268 CegarLoopResult]: For program point L30-10(lines 30 33) no Hoare annotation was computed. [2020-07-01 11:08:59,734 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 11:08:59,734 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-07-01 11:08:59,734 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base)) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) [2020-07-01 11:08:59,735 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,735 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 11:08:59,735 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse7 (select |#length| |ULTIMATE.start_main_#t~ret11.base|))) (let ((.cse3 (<= 1 .cse7)) (.cse0 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret11.base|))) (.cse1 (= 0 |ULTIMATE.start_main_#t~ret11.offset|)) (.cse2 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse4 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse5 (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base))) (.cse6 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0))) (or (and .cse0 .cse1 .cse2 (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) |ULTIMATE.start_main_#t~ret11.offset|) 0) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) 1) .cse4 .cse5 .cse6) (and (exists ((v_prenex_2 Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret11.base|) v_prenex_2 (- 1)))) (<= v_prenex_2 0) (<= |ULTIMATE.start_main_#t~ret11.offset| v_prenex_2))) .cse0 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret11.base|)) .cse1 .cse2 (< 1 .cse7) .cse4 .cse5 .cse6)))) [2020-07-01 11:08:59,735 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-07-01 11:08:59,735 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,735 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:08:59,735 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,735 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point L12-3(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point L12-5(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2020-07-01 11:08:59,736 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:08:59,739 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 11:08:59,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:08:59,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:08:59,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:08:59,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,769 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,769 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,769 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,769 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,772 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,772 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,772 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,772 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,774 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,774 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,774 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,774 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:08:59,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:08:59,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:08:59,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:08:59,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:08:59,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:08:59,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,810 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:08:59,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:08:59,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:08:59,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:08:59 BasicIcfg [2020-07-01 11:08:59,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:08:59,828 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:08:59,828 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:08:59,831 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:08:59,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:08:59,832 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:07:54" (1/5) ... [2020-07-01 11:08:59,833 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b4d5024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:08:59, skipping insertion in model container [2020-07-01 11:08:59,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:08:59,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:07:55" (2/5) ... [2020-07-01 11:08:59,833 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b4d5024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:08:59, skipping insertion in model container [2020-07-01 11:08:59,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:08:59,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:07:55" (3/5) ... [2020-07-01 11:08:59,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b4d5024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:08:59, skipping insertion in model container [2020-07-01 11:08:59,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:08:59,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:07:55" (4/5) ... [2020-07-01 11:08:59,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b4d5024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:08:59, skipping insertion in model container [2020-07-01 11:08:59,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:08:59,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:08:59" (5/5) ... [2020-07-01 11:08:59,836 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:08:59,857 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:08:59,857 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:08:59,857 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:08:59,857 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:08:59,857 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:08:59,858 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:08:59,858 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:08:59,858 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:08:59,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-07-01 11:08:59,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 11:08:59,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:08:59,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:08:59,870 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:59,870 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:08:59,870 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:08:59,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-07-01 11:08:59,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 11:08:59,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:08:59,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:08:59,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:08:59,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:08:59,877 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [187] ULTIMATE.startENTRY-->L12: Formula: (and (< 0 |v_#StackHeapBarrier_4|) (= 0 |v_#NULL.base_2|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_21| (store |v_#valid_22| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 14#L12true [126] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 11#L12-2true [148] L12-2-->L16: Formula: (and (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| |v_#StackHeapBarrier_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 4#L16true [189] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (= |v_ULTIMATE.start_main_#t~ret11.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (<= 1 .cse0) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= |v_ULTIMATE.start_main_#t~ret11.base_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#t~ret11.base, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 27#L12-3true [130] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 25#L12-5true [154] L12-5-->L16-2: Formula: (and (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) (< |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| |v_#StackHeapBarrier_3|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 16#L16-2true [191] L16-2-->L30-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (= |v_ULTIMATE.start_main_#t~ret11.base_7| |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret12.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start_main_#t~ret11.offset_7| |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_main_#t~ret12.offset_5| |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (<= 1 .cse0))) InVars {ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrcmp_#t~mem9=|v_ULTIMATE.start_cstrcmp_#t~mem9_5|, ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_10|, ULTIMATE.start_cstrcmp_#t~mem8=|v_ULTIMATE.start_cstrcmp_#t~mem8_5|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_4|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_4|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_4|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_5|, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_5|, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~ite10=|v_ULTIMATE.start_cstrcmp_#t~ite10_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem9, ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~mem8, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrcmp_~uc1~0, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_main_#t~ret12.offset, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_main_#t~ret12.base, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~ite10, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base] 29#L30-9true [2020-07-01 11:08:59,877 INFO L796 eck$LassoCheckResult]: Loop: 29#L30-9true [118] L30-9-->L30-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrcmp_~s1.base_3) 1) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 26#L30-1true [167] L30-1-->L30-2: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short5_2| (> 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_2|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 23#L30-2true [111] L30-2-->L30-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short5_5|) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} AuxVars[] AssignedVars[] 31#L30-7true [123] L30-7-->L30-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrcmp_~s2.offset_6 (+ v_ULTIMATE.start_cstrcmp_~s2.offset_7 1)) (= v_ULTIMATE.start_cstrcmp_~s2.base_8 v_ULTIMATE.start_cstrcmp_~s2.base_7) |v_ULTIMATE.start_cstrcmp_#t~short5_9| (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10)) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_9|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_8|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_2|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_2|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4] 29#L30-9true [2020-07-01 11:08:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash -342978630, now seen corresponding path program 1 times [2020-07-01 11:08:59,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:59,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412467658] [2020-07-01 11:08:59,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:08:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:08:59,907 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:08:59,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:08:59,908 INFO L82 PathProgramCache]: Analyzing trace with hash 4602910, now seen corresponding path program 1 times [2020-07-01 11:08:59,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:08:59,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250547696] [2020-07-01 11:08:59,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:08:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:08:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:08:59,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250547696] [2020-07-01 11:08:59,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:08:59,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:08:59,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612097610] [2020-07-01 11:08:59,917 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:08:59,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:08:59,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:08:59,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:08:59,919 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-07-01 11:08:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:08:59,993 INFO L93 Difference]: Finished difference Result 32 states and 55 transitions. [2020-07-01 11:08:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:08:59,996 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 11:09:00,000 INFO L168 Benchmark]: Toolchain (without parser) took 65024.22 ms. Allocated memory was 649.6 MB in the beginning and 943.2 MB in the end (delta: 293.6 MB). Free memory was 557.4 MB in the beginning and 806.5 MB in the end (delta: -249.1 MB). Peak memory consumption was 44.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:09:00,000 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:09:00,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.86 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 557.4 MB in the beginning and 651.4 MB in the end (delta: -94.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. [2020-07-01 11:09:00,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.11 ms. Allocated memory is still 690.0 MB. Free memory was 651.4 MB in the beginning and 649.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:09:00,001 INFO L168 Benchmark]: Boogie Preprocessor took 25.58 ms. Allocated memory is still 690.0 MB. Free memory was 649.3 MB in the beginning and 648.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:09:00,001 INFO L168 Benchmark]: RCFGBuilder took 350.17 ms. Allocated memory is still 690.0 MB. Free memory was 648.2 MB in the beginning and 622.5 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 50.3 GB. [2020-07-01 11:09:00,002 INFO L168 Benchmark]: BlockEncodingV2 took 140.80 ms. Allocated memory is still 690.0 MB. Free memory was 622.5 MB in the beginning and 610.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. [2020-07-01 11:09:00,002 INFO L168 Benchmark]: TraceAbstraction took 63984.08 ms. Allocated memory was 690.0 MB in the beginning and 943.2 MB in the end (delta: 253.2 MB). Free memory was 610.7 MB in the beginning and 827.6 MB in the end (delta: -217.0 MB). Peak memory consumption was 508.9 MB. Max. memory is 50.3 GB. [2020-07-01 11:09:00,002 INFO L168 Benchmark]: BuchiAutomizer took 170.42 ms. Allocated memory is still 943.2 MB. Free memory was 827.6 MB in the beginning and 806.5 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:09:00,006 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 48 edges - StatisticsResult: Encoded RCFG 30 locations, 53 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 305.86 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 557.4 MB in the beginning and 651.4 MB in the end (delta: -94.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.11 ms. Allocated memory is still 690.0 MB. Free memory was 651.4 MB in the beginning and 649.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.58 ms. Allocated memory is still 690.0 MB. Free memory was 649.3 MB in the beginning and 648.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 350.17 ms. Allocated memory is still 690.0 MB. Free memory was 648.2 MB in the beginning and 622.5 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 140.80 ms. Allocated memory is still 690.0 MB. Free memory was 622.5 MB in the beginning and 610.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 63984.08 ms. Allocated memory was 690.0 MB in the beginning and 943.2 MB in the end (delta: 253.2 MB). Free memory was 610.7 MB in the beginning and 827.6 MB in the end (delta: -217.0 MB). Peak memory consumption was 508.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 170.42 ms. Allocated memory is still 943.2 MB. Free memory was 827.6 MB in the beginning and 806.5 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2020-07-01 11:09:00,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:09:00,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:09:00,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:09:00,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,024 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,033 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,033 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,033 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,033 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,033 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,034 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,034 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,034 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,034 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,035 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,035 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,035 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,035 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,036 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,036 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,036 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:09:00,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:09:00,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2020-07-01 11:09:00,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-07-01 11:09:00,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:09:00,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:09:00,046 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,047 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,047 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,047 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,049 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,049 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,049 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,049 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,049 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,055 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,055 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,055 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,055 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,055 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((s1 == 0 && (\exists v_prenex_5 : int :: (0 == unknown-#memory_int-unknown[s2][v_prenex_5] && s2 <= v_prenex_5) && v_prenex_5 + 1 <= unknown-#length-unknown[s2])) && ((((\exists v_prenex_2 : int :: (0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_prenex_2 + -1] && v_prenex_2 <= 0) && __VERIFIER_nondet_String() <= v_prenex_2) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 < unknown-#length-unknown[__VERIFIER_nondet_String()]) || (((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int :: (0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + -1] && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 <= 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 == unknown-#length-unknown[__VERIFIER_nondet_String()]))) && (((1 < unknown-#length-unknown[s1] && (\exists v_prenex_2 : int :: (0 == unknown-#memory_int-unknown[s1][v_prenex_2 + unknown-#length-unknown[s1] + -1] && v_prenex_2 <= 0) && s1 <= v_prenex_2)) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1] && !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1))) || ((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int :: (0 == unknown-#memory_int-unknown[s1][v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + unknown-#length-unknown[s1] + -1] && s1 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 <= 0) && unknown-#length-unknown[s1] == 1))) && 0 == __VERIFIER_nondet_String()) && 1 == \valid[s2]) && unknown-#length-unknown[nondetString] == length) && 0 == s2) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[s2][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s2] + -1])) && !(nondetString == __VERIFIER_nondet_String())) && nondetString == 0) && 1 == \valid[s1]) && 1 == \valid[nondetString]) && (1 < length || 1 == length)) || ((((((((((((((s1 == 0 && 0 == unknown-#memory_int-unknown[s2][s2]) && 0 == __VERIFIER_nondet_String()) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s1]) && unknown-#length-unknown[nondetString] == length) && 0 == s2) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s1]) && length + nondetString <= 1) && 1 == \valid[nondetString]) && 1 <= length)) || ((((((((((((((s1 == 0 && 0 == __VERIFIER_nondet_String()) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 <= unknown-#length-unknown[s1]) && unknown-#length-unknown[nondetString] == length) && 0 == s2) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()] == 0) && 1 <= unknown-#length-unknown[s2]) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s1]) && 1 == \valid[nondetString]) && 1 <= length)) || (((((((((((((((s1 + 1 <= unknown-#length-unknown[s1] && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) && ((((\exists v_prenex_2 : int :: (0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_prenex_2 + -1] && v_prenex_2 <= 0) && __VERIFIER_nondet_String() <= v_prenex_2) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 < unknown-#length-unknown[__VERIFIER_nondet_String()]) || (((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int :: (0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + -1] && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 <= 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 == unknown-#length-unknown[__VERIFIER_nondet_String()]))) && 0 == __VERIFIER_nondet_String()) && (!(1 == length + nondetString) || 1 == length)) && 1 == \valid[s2]) && 1 <= s2) && unknown-#length-unknown[nondetString] == length) && ((1 < length && nondetString == 0) || 1 == length + nondetString)) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[s2][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s2] + -1])) && !(nondetString == __VERIFIER_nondet_String())) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1] && !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1))) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString]) && 1 <= s1) - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 11:09:00,058 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,058 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((nondetString == 0 && 1 == \valid[nondetString]) && unknown-#length-unknown[nondetString] == length) && 1 <= length - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 11:09:00,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,059 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,059 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:09:00,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:09:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:09:00,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[__VERIFIER_nondet_String()] && 0 == __VERIFIER_nondet_String()) && nondetString == 0) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()] == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length) || (((((((1 == \valid[__VERIFIER_nondet_String()] && 0 == __VERIFIER_nondet_String()) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && length + nondetString <= 1) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length)) || (((((((((\exists v_prenex_2 : int :: (0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_prenex_2 + -1] && v_prenex_2 <= 0) && __VERIFIER_nondet_String() <= v_prenex_2) && 1 == \valid[__VERIFIER_nondet_String()]) && !(nondetString == __VERIFIER_nondet_String())) && 0 == __VERIFIER_nondet_String()) && nondetString == 0) && 1 < unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 54.0s, OverallIterations: 27, TraceHistogramMax: 4, AutomataDifference: 44.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 207 SDtfs, 3177 SDslu, 1479 SDs, 0 SdLazy, 3826 SolverSat, 422 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 210 SyntacticMatches, 7 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 43.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 562 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 15 NumberOfFragments, 683 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1033403 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 44082 FormulaSimplificationTreeSizeReductionInter, 9.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 611 ConstructedInterpolants, 74 QuantifiedInterpolants, 161174 SizeOfPredicates, 109 NumberOfNonLiveVariables, 1527 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 74/269 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 11:07:51.667 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_uWNEL3/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:09:00.290 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check