java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:42:28,878 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:42:28,879 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:42:28,893 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:42:28,893 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:42:28,894 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:42:28,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:42:28,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:42:28,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:42:28,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:42:28,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:42:28,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:42:28,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:42:28,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:42:28,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:42:28,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:42:28,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:42:28,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:42:28,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:42:28,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:42:28,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:42:28,915 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:42:28,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:42:28,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:42:28,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:42:28,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:42:28,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:42:28,919 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:42:28,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:42:28,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:42:28,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:42:28,920 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:42:28,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:42:28,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:42:28,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:42:28,930 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:42:28,931 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:42:28,931 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:42:28,931 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:42:28,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:42:28,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:42:28,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:42:28,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:42:28,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:42:28,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:42:28,933 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:42:28,933 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:42:28,933 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:42:28,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:42:28,934 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:42:28,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:42:28,934 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:42:28,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:42:28,934 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:42:28,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:42:28,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:42:28,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:42:28,935 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:42:28,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:42:28,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:42:28,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:42:28,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:42:28,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:42:28,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:42:28,937 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:42:28,937 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:42:28,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:42:28,984 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:42:28,988 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:42:28,990 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:42:28,990 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:42:28,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:42:29,160 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:42:29,166 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:42:29,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:42:29,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:42:29,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:42:29,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29, skipping insertion in model container [2018-01-29 22:42:29,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,194 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:42:29,235 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:42:29,346 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:42:29,363 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:42:29,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29 WrapperNode [2018-01-29 22:42:29,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:42:29,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:42:29,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:42:29,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:42:29,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (1/1) ... [2018-01-29 22:42:29,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:42:29,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:42:29,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:42:29,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:42:29,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:42:29,457 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:42:29,457 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:42:29,457 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-29 22:42:29,457 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:42:29,457 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:42:29,458 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:42:29,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:42:29,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:42:29,458 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:42:29,458 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:42:29,458 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-29 22:42:29,459 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:42:29,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:42:29,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:42:29,864 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:42:29,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:42:29 BoogieIcfgContainer [2018-01-29 22:42:29,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:42:29,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:42:29,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:42:29,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:42:29,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:42:29" (1/3) ... [2018-01-29 22:42:29,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2ed516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:42:29, skipping insertion in model container [2018-01-29 22:42:29,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:29" (2/3) ... [2018-01-29 22:42:29,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2ed516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:42:29, skipping insertion in model container [2018-01-29 22:42:29,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:42:29" (3/3) ... [2018-01-29 22:42:29,872 INFO L107 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:42:29,879 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:42:29,886 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-29 22:42:29,926 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:42:29,926 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:42:29,927 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:42:29,927 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:42:29,927 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:42:29,927 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:42:29,927 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:42:29,927 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:42:29,928 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:42:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-29 22:42:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 22:42:29,952 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:29,953 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:29,953 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1908139925, now seen corresponding path program 1 times [2018-01-29 22:42:29,959 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:29,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:30,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:30,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:30,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:30,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:30,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:30,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:42:30,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:42:30,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:42:30,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:42:30,313 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 4 states. [2018-01-29 22:42:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:30,473 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2018-01-29 22:42:30,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:42:30,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-29 22:42:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:30,487 INFO L225 Difference]: With dead ends: 195 [2018-01-29 22:42:30,488 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 22:42:30,492 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:42:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 22:42:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-01-29 22:42:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 22:42:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-29 22:42:30,533 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 28 [2018-01-29 22:42:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:30,534 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-29 22:42:30,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:42:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-29 22:42:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 22:42:30,535 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:30,535 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:30,535 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1908139926, now seen corresponding path program 1 times [2018-01-29 22:42:30,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:30,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:30,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:30,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:30,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:30,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:30,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:30,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:42:30,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:42:30,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:42:30,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:42:30,812 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 10 states. [2018-01-29 22:42:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:31,143 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2018-01-29 22:42:31,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:42:31,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-01-29 22:42:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:31,147 INFO L225 Difference]: With dead ends: 202 [2018-01-29 22:42:31,147 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 22:42:31,148 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:42:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 22:42:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2018-01-29 22:42:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-29 22:42:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-29 22:42:31,162 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 28 [2018-01-29 22:42:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:31,163 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-29 22:42:31,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:42:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-29 22:42:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-29 22:42:31,164 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:31,164 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:31,164 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash -977204472, now seen corresponding path program 1 times [2018-01-29 22:42:31,165 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:31,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:31,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:31,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:31,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:31,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:31,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:31,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:42:31,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:42:31,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:42:31,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:42:31,227 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 4 states. [2018-01-29 22:42:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:31,317 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-01-29 22:42:31,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:42:31,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-29 22:42:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:31,318 INFO L225 Difference]: With dead ends: 118 [2018-01-29 22:42:31,318 INFO L226 Difference]: Without dead ends: 116 [2018-01-29 22:42:31,319 INFO L553 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 [2018-01-29 22:42:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-29 22:42:31,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-29 22:42:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 22:42:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-01-29 22:42:31,328 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 29 [2018-01-29 22:42:31,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:31,328 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-01-29 22:42:31,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:42:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-01-29 22:42:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-29 22:42:31,329 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:31,329 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:31,329 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:31,329 INFO L82 PathProgramCache]: Analyzing trace with hash -977204471, now seen corresponding path program 1 times [2018-01-29 22:42:31,329 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:31,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:31,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:31,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:31,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:31,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:31,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:31,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:42:31,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:42:31,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:42:31,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:42:31,489 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 8 states. [2018-01-29 22:42:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:31,788 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-01-29 22:42:31,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:42:31,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-29 22:42:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:31,789 INFO L225 Difference]: With dead ends: 148 [2018-01-29 22:42:31,790 INFO L226 Difference]: Without dead ends: 146 [2018-01-29 22:42:31,790 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:42:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-29 22:42:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2018-01-29 22:42:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-29 22:42:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-01-29 22:42:31,800 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 29 [2018-01-29 22:42:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:31,801 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-01-29 22:42:31,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:42:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-01-29 22:42:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-29 22:42:31,802 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:31,803 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:31,803 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1049680860, now seen corresponding path program 1 times [2018-01-29 22:42:31,803 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:31,803 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:31,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:31,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:31,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:31,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:31,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:31,975 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:31,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:32,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:32,053 INFO L477 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 8 treesize of output 7 [2018-01-29 22:42:32,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:32,062 INFO L477 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 [2018-01-29 22:42:32,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:32,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:32,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-29 22:42:32,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:32,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:32,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:42:32,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:32,111 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 22:42:32,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:32,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:32,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-29 22:42:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:32,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:32,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-01-29 22:42:32,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 22:42:32,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 22:42:32,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:42:32,364 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 15 states. [2018-01-29 22:42:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:33,246 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2018-01-29 22:42:33,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 22:42:33,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-01-29 22:42:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:33,248 INFO L225 Difference]: With dead ends: 196 [2018-01-29 22:42:33,248 INFO L226 Difference]: Without dead ends: 193 [2018-01-29 22:42:33,248 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-01-29 22:42:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-29 22:42:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 142. [2018-01-29 22:42:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-29 22:42:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-01-29 22:42:33,259 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 35 [2018-01-29 22:42:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:33,259 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-01-29 22:42:33,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 22:42:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-01-29 22:42:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 22:42:33,260 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:33,260 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:33,260 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1003669364, now seen corresponding path program 1 times [2018-01-29 22:42:33,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:33,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:33,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:33,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:33,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:33,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:33,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:33,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 22:42:33,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 22:42:33,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 22:42:33,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:42:33,458 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 11 states. [2018-01-29 22:42:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:33,541 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2018-01-29 22:42:33,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:42:33,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-29 22:42:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:33,543 INFO L225 Difference]: With dead ends: 142 [2018-01-29 22:42:33,543 INFO L226 Difference]: Without dead ends: 140 [2018-01-29 22:42:33,543 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:42:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-29 22:42:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-29 22:42:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-29 22:42:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2018-01-29 22:42:33,556 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 41 [2018-01-29 22:42:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:33,556 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2018-01-29 22:42:33,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 22:42:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2018-01-29 22:42:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 22:42:33,558 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:33,558 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:33,558 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:33,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1003669365, now seen corresponding path program 1 times [2018-01-29 22:42:33,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:33,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:33,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:33,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:33,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:33,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:33,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:33,643 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:33,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:33,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:33,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:33,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-01-29 22:42:33,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:42:33,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:42:33,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:42:33,754 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 10 states. [2018-01-29 22:42:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:34,034 INFO L93 Difference]: Finished difference Result 301 states and 331 transitions. [2018-01-29 22:42:34,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:42:34,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-29 22:42:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:34,039 INFO L225 Difference]: With dead ends: 301 [2018-01-29 22:42:34,040 INFO L226 Difference]: Without dead ends: 199 [2018-01-29 22:42:34,041 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:42:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-29 22:42:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 150. [2018-01-29 22:42:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 22:42:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2018-01-29 22:42:34,054 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 41 [2018-01-29 22:42:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:34,055 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2018-01-29 22:42:34,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:42:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2018-01-29 22:42:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-29 22:42:34,056 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:34,056 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:34,057 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash 240088303, now seen corresponding path program 2 times [2018-01-29 22:42:34,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:34,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:34,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:34,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:34,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-29 22:42:34,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:34,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 22:42:34,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 22:42:34,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 22:42:34,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:42:34,303 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand 11 states. [2018-01-29 22:42:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:34,645 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2018-01-29 22:42:34,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 22:42:34,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-01-29 22:42:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:34,647 INFO L225 Difference]: With dead ends: 209 [2018-01-29 22:42:34,647 INFO L226 Difference]: Without dead ends: 207 [2018-01-29 22:42:34,648 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-01-29 22:42:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-29 22:42:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 157. [2018-01-29 22:42:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-29 22:42:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2018-01-29 22:42:34,663 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 48 [2018-01-29 22:42:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:34,663 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2018-01-29 22:42:34,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 22:42:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2018-01-29 22:42:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 22:42:34,665 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:34,665 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:34,665 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash -930738850, now seen corresponding path program 1 times [2018-01-29 22:42:34,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:34,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:34,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,667 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:42:34,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:34,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:34,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:34,759 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:34,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:34,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:34,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:34,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-01-29 22:42:34,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 22:42:34,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 22:42:34,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:42:34,965 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand 14 states. [2018-01-29 22:42:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:35,263 INFO L93 Difference]: Finished difference Result 222 states and 240 transitions. [2018-01-29 22:42:35,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 22:42:35,263 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-01-29 22:42:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:35,265 INFO L225 Difference]: With dead ends: 222 [2018-01-29 22:42:35,265 INFO L226 Difference]: Without dead ends: 194 [2018-01-29 22:42:35,266 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-01-29 22:42:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-29 22:42:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 172. [2018-01-29 22:42:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-29 22:42:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 191 transitions. [2018-01-29 22:42:35,280 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 191 transitions. Word has length 49 [2018-01-29 22:42:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:35,281 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 191 transitions. [2018-01-29 22:42:35,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 22:42:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 191 transitions. [2018-01-29 22:42:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 22:42:35,282 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:35,282 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:35,282 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash 353418487, now seen corresponding path program 1 times [2018-01-29 22:42:35,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:35,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:35,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:35,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:35,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:35,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-29 22:42:35,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:35,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 22:42:35,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 22:42:35,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 22:42:35,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:42:35,504 INFO L87 Difference]: Start difference. First operand 172 states and 191 transitions. Second operand 11 states. [2018-01-29 22:42:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:35,685 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2018-01-29 22:42:35,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 22:42:35,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-01-29 22:42:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:35,688 INFO L225 Difference]: With dead ends: 204 [2018-01-29 22:42:35,688 INFO L226 Difference]: Without dead ends: 202 [2018-01-29 22:42:35,689 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-01-29 22:42:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-29 22:42:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2018-01-29 22:42:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:42:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2018-01-29 22:42:35,701 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 53 [2018-01-29 22:42:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:35,702 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2018-01-29 22:42:35,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 22:42:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2018-01-29 22:42:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-29 22:42:35,703 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:35,703 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:35,703 INFO L371 AbstractCegarLoop]: === Iteration 11 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:35,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1031396761, now seen corresponding path program 1 times [2018-01-29 22:42:35,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:35,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:35,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:35,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:35,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:35,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-29 22:42:35,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:35,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:42:35,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:42:35,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:42:35,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:42:35,730 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand 3 states. [2018-01-29 22:42:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:35,757 INFO L93 Difference]: Finished difference Result 289 states and 322 transitions. [2018-01-29 22:42:35,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:42:35,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-29 22:42:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:35,759 INFO L225 Difference]: With dead ends: 289 [2018-01-29 22:42:35,759 INFO L226 Difference]: Without dead ends: 172 [2018-01-29 22:42:35,759 INFO L553 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 [2018-01-29 22:42:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-29 22:42:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-29 22:42:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-29 22:42:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-01-29 22:42:35,769 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 58 [2018-01-29 22:42:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:35,769 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-01-29 22:42:35,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:42:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-01-29 22:42:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 22:42:35,770 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:35,770 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:35,770 INFO L371 AbstractCegarLoop]: === Iteration 12 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1920877196, now seen corresponding path program 1 times [2018-01-29 22:42:35,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:35,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:35,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:35,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:35,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:35,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:42:35,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:35,841 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:35,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:35,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-29 22:42:35,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:42:35,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2018-01-29 22:42:35,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 22:42:35,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 22:42:35,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:42:35,986 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 13 states. [2018-01-29 22:42:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:36,267 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2018-01-29 22:42:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 22:42:36,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-01-29 22:42:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:36,269 INFO L225 Difference]: With dead ends: 342 [2018-01-29 22:42:36,269 INFO L226 Difference]: Without dead ends: 266 [2018-01-29 22:42:36,270 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-01-29 22:42:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-29 22:42:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 220. [2018-01-29 22:42:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-29 22:42:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2018-01-29 22:42:36,279 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 60 [2018-01-29 22:42:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:36,279 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2018-01-29 22:42:36,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 22:42:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2018-01-29 22:42:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 22:42:36,280 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:36,280 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:36,280 INFO L371 AbstractCegarLoop]: === Iteration 13 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:36,280 INFO L82 PathProgramCache]: Analyzing trace with hash 993444599, now seen corresponding path program 1 times [2018-01-29 22:42:36,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:36,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:36,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:36,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:36,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:36,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 22:42:36,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:42:36,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:42:36,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:42:36,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:42:36,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:42:36,678 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 8 states. [2018-01-29 22:42:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:36,791 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2018-01-29 22:42:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:42:36,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-29 22:42:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:36,793 INFO L225 Difference]: With dead ends: 220 [2018-01-29 22:42:36,793 INFO L226 Difference]: Without dead ends: 188 [2018-01-29 22:42:36,793 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:42:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-29 22:42:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-01-29 22:42:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-29 22:42:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 206 transitions. [2018-01-29 22:42:36,808 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 206 transitions. Word has length 61 [2018-01-29 22:42:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:36,808 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 206 transitions. [2018-01-29 22:42:36,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:42:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2018-01-29 22:42:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-29 22:42:36,810 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:36,810 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:36,810 INFO L371 AbstractCegarLoop]: === Iteration 14 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:36,810 INFO L82 PathProgramCache]: Analyzing trace with hash 390335828, now seen corresponding path program 1 times [2018-01-29 22:42:36,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:36,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:36,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:36,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:36,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:36,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-29 22:42:36,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:36,923 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:36,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:36,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-29 22:42:37,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:42:37,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-29 22:42:37,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:42:37,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:42:37,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:42:37,051 INFO L87 Difference]: Start difference. First operand 188 states and 206 transitions. Second operand 10 states. [2018-01-29 22:42:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:37,206 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2018-01-29 22:42:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:42:37,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-01-29 22:42:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:37,207 INFO L225 Difference]: With dead ends: 314 [2018-01-29 22:42:37,207 INFO L226 Difference]: Without dead ends: 191 [2018-01-29 22:42:37,207 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-29 22:42:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-29 22:42:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 184. [2018-01-29 22:42:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-29 22:42:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 198 transitions. [2018-01-29 22:42:37,224 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 198 transitions. Word has length 64 [2018-01-29 22:42:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:37,224 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 198 transitions. [2018-01-29 22:42:37,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:42:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 198 transitions. [2018-01-29 22:42:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 22:42:37,225 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:37,225 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:37,226 INFO L371 AbstractCegarLoop]: === Iteration 15 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1083282026, now seen corresponding path program 1 times [2018-01-29 22:42:37,226 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:37,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:37,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:37,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 22:42:37,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:37,399 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:37,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:37,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 22:42:37,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:37,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-29 22:42:37,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 22:42:37,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 22:42:37,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-29 22:42:37,609 INFO L87 Difference]: Start difference. First operand 184 states and 198 transitions. Second operand 20 states. [2018-01-29 22:42:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:37,965 INFO L93 Difference]: Finished difference Result 225 states and 242 transitions. [2018-01-29 22:42:37,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 22:42:37,965 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-01-29 22:42:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:37,966 INFO L225 Difference]: With dead ends: 225 [2018-01-29 22:42:37,966 INFO L226 Difference]: Without dead ends: 223 [2018-01-29 22:42:37,967 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 22:42:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-29 22:42:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-01-29 22:42:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-29 22:42:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2018-01-29 22:42:37,979 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 79 [2018-01-29 22:42:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:37,980 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2018-01-29 22:42:37,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 22:42:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2018-01-29 22:42:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 22:42:37,980 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:37,981 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:37,981 INFO L371 AbstractCegarLoop]: === Iteration 16 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 615914539, now seen corresponding path program 1 times [2018-01-29 22:42:37,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:37,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:37,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:37,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:37,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 22:42:38,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:38,155 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:38,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:38,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:42:38,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:38,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-01-29 22:42:38,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 22:42:38,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 22:42:38,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-01-29 22:42:38,451 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand 23 states. [2018-01-29 22:42:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:39,326 INFO L93 Difference]: Finished difference Result 291 states and 319 transitions. [2018-01-29 22:42:39,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 22:42:39,326 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-01-29 22:42:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:39,327 INFO L225 Difference]: With dead ends: 291 [2018-01-29 22:42:39,327 INFO L226 Difference]: Without dead ends: 288 [2018-01-29 22:42:39,328 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=611, Invalid=2041, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 22:42:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-29 22:42:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 217. [2018-01-29 22:42:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-29 22:42:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 236 transitions. [2018-01-29 22:42:39,342 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 236 transitions. Word has length 82 [2018-01-29 22:42:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:39,342 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 236 transitions. [2018-01-29 22:42:39,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 22:42:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 236 transitions. [2018-01-29 22:42:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-29 22:42:39,343 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:39,344 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:39,344 INFO L371 AbstractCegarLoop]: === Iteration 17 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:39,344 INFO L82 PathProgramCache]: Analyzing trace with hash -44753279, now seen corresponding path program 2 times [2018-01-29 22:42:39,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:39,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:39,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:39,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:39,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:39,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 22:42:39,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:39,457 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:39,465 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:42:39,477 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:42:39,486 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:42:39,488 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:42:39,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 22:42:39,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:39,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-01-29 22:42:39,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 22:42:39,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 22:42:39,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-01-29 22:42:39,589 INFO L87 Difference]: Start difference. First operand 217 states and 236 transitions. Second operand 20 states. [2018-01-29 22:42:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:39,845 INFO L93 Difference]: Finished difference Result 293 states and 318 transitions. [2018-01-29 22:42:39,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:42:39,846 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2018-01-29 22:42:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:39,846 INFO L225 Difference]: With dead ends: 293 [2018-01-29 22:42:39,847 INFO L226 Difference]: Without dead ends: 213 [2018-01-29 22:42:39,847 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 22:42:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-29 22:42:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 178. [2018-01-29 22:42:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-29 22:42:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-01-29 22:42:39,863 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 87 [2018-01-29 22:42:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:39,863 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-01-29 22:42:39,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 22:42:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-01-29 22:42:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-29 22:42:39,865 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:39,865 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:39,865 INFO L371 AbstractCegarLoop]: === Iteration 18 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:39,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1585459244, now seen corresponding path program 2 times [2018-01-29 22:42:39,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:39,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:39,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:39,866 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:42:39,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:39,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-29 22:42:39,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:39,962 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:39,969 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:42:39,988 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:42:39,991 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:42:39,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:40,007 INFO L477 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 8 treesize of output 7 [2018-01-29 22:42:40,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:40,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:40,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:42:40,046 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 22:42:40,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:40,053 INFO L267 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. [2018-01-29 22:42:40,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-29 22:42:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-01-29 22:42:40,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:40,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-01-29 22:42:40,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 22:42:40,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 22:42:40,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:42:40,173 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 11 states. [2018-01-29 22:42:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:40,661 INFO L93 Difference]: Finished difference Result 344 states and 377 transitions. [2018-01-29 22:42:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 22:42:40,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-01-29 22:42:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:40,663 INFO L225 Difference]: With dead ends: 344 [2018-01-29 22:42:40,663 INFO L226 Difference]: Without dead ends: 259 [2018-01-29 22:42:40,663 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2018-01-29 22:42:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-29 22:42:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 159. [2018-01-29 22:42:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-29 22:42:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-01-29 22:42:40,675 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 90 [2018-01-29 22:42:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:40,675 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-01-29 22:42:40,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 22:42:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-01-29 22:42:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-29 22:42:40,676 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:40,677 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:40,677 INFO L371 AbstractCegarLoop]: === Iteration 19 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1982176244, now seen corresponding path program 1 times [2018-01-29 22:42:40,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:40,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:40,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:40,678 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:42:40,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:40,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-29 22:42:40,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:40,861 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:40,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:40,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-29 22:42:41,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:41,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-01-29 22:42:41,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 22:42:41,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 22:42:41,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-01-29 22:42:41,202 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 23 states. [2018-01-29 22:42:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:41,966 INFO L93 Difference]: Finished difference Result 278 states and 302 transitions. [2018-01-29 22:42:41,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:42:41,966 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-01-29 22:42:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:41,968 INFO L225 Difference]: With dead ends: 278 [2018-01-29 22:42:41,968 INFO L226 Difference]: Without dead ends: 210 [2018-01-29 22:42:41,969 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 22:42:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-29 22:42:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 184. [2018-01-29 22:42:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-29 22:42:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2018-01-29 22:42:41,980 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 94 [2018-01-29 22:42:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:41,980 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2018-01-29 22:42:41,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 22:42:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2018-01-29 22:42:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-29 22:42:41,982 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:41,982 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:41,982 INFO L371 AbstractCegarLoop]: === Iteration 20 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash 338548953, now seen corresponding path program 2 times [2018-01-29 22:42:41,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:41,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:41,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:41,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:42:41,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:41,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-29 22:42:42,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:42,104 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:42,109 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:42:42,122 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:42:42,134 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:42:42,137 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:42:42,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-29 22:42:42,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:42:42,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 21 [2018-01-29 22:42:42,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:42:42,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:42:42,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:42:42,316 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand 21 states. [2018-01-29 22:42:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:42,975 INFO L93 Difference]: Finished difference Result 363 states and 391 transitions. [2018-01-29 22:42:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 22:42:42,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-01-29 22:42:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:42,978 INFO L225 Difference]: With dead ends: 363 [2018-01-29 22:42:42,978 INFO L226 Difference]: Without dead ends: 267 [2018-01-29 22:42:42,979 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1917, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 22:42:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-01-29 22:42:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 240. [2018-01-29 22:42:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-29 22:42:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 256 transitions. [2018-01-29 22:42:43,002 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 256 transitions. Word has length 109 [2018-01-29 22:42:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:43,002 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 256 transitions. [2018-01-29 22:42:43,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:42:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 256 transitions. [2018-01-29 22:42:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-29 22:42:43,003 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:42:43,004 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:42:43,004 INFO L371 AbstractCegarLoop]: === Iteration 21 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 22:42:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1285149348, now seen corresponding path program 3 times [2018-01-29 22:42:43,004 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:42:43,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:42:43,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:43,005 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:42:43,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:42:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:42:43,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:42:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 62 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-29 22:42:43,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:42:43,317 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:42:43,322 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:42:43,336 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:42:43,341 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:42:43,342 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:42:43,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:42:43,349 INFO L477 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 [2018-01-29 22:42:43,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:43,355 INFO L477 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 8 treesize of output 7 [2018-01-29 22:42:43,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:43,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:43,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-29 22:42:43,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:43,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:42:43,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:42:43,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:43,393 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 22:42:43,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:42:43,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:42:43,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-29 22:42:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-01-29 22:42:43,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:42:43,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2018-01-29 22:42:43,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 22:42:43,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 22:42:43,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=520, Unknown=1, NotChecked=0, Total=600 [2018-01-29 22:42:43,971 INFO L87 Difference]: Start difference. First operand 240 states and 256 transitions. Second operand 25 states. [2018-01-29 22:42:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:42:45,901 INFO L93 Difference]: Finished difference Result 290 states and 311 transitions. [2018-01-29 22:42:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 22:42:45,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2018-01-29 22:42:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:42:45,902 INFO L225 Difference]: With dead ends: 290 [2018-01-29 22:42:45,902 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:42:45,903 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=719, Invalid=2250, Unknown=1, NotChecked=0, Total=2970 [2018-01-29 22:42:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:42:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:42:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:42:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:42:45,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2018-01-29 22:42:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:42:45,904 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:42:45,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 22:42:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:42:45,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:42:45,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:42:46,017 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-29 22:42:46,081 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 149 DAG size of output 137 [2018-01-29 22:42:46,255 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-29 22:42:46,512 WARN L146 SmtUtils]: Spent 277ms on a formula simplification. DAG size of input: 169 DAG size of output 164 [2018-01-29 22:42:48,571 WARN L146 SmtUtils]: Spent 2056ms on a formula simplification. DAG size of input: 141 DAG size of output 107 [2018-01-29 22:42:49,785 WARN L146 SmtUtils]: Spent 1189ms on a formula simplification. DAG size of input: 136 DAG size of output 98 [2018-01-29 22:42:50,775 WARN L146 SmtUtils]: Spent 946ms on a formula simplification. DAG size of input: 115 DAG size of output 86 [2018-01-29 22:42:52,289 WARN L146 SmtUtils]: Spent 1511ms on a formula simplification. DAG size of input: 170 DAG size of output 102 [2018-01-29 22:42:52,292 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,322 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,322 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:42:52,322 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,322 INFO L399 ceAbstractionStarter]: For program point L549'''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,322 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-29 22:42:52,322 INFO L399 ceAbstractionStarter]: For program point lisErr16RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,322 INFO L399 ceAbstractionStarter]: For program point L549''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,322 INFO L399 ceAbstractionStarter]: For program point lisErr7RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,322 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L549'''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L549''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point lisErr5RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point lisFINAL(lines 540 555) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point lisErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point lisErr18RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L549''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point L547''(lines 547 550) no Hoare annotation was computed. [2018-01-29 22:42:52,323 INFO L399 ceAbstractionStarter]: For program point lisErr20RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point L552''''(line 552) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point lisErr12RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point L549''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point lisErr4RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point L549'''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L399 ceAbstractionStarter]: For program point L549''''''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,324 INFO L395 ceAbstractionStarter]: At program point L548''''''(lines 548 550) the Hoare annotation is: (let ((.cse31 (select |#valid| lis_~a.base)) (.cse30 (select |#length| lis_~best~2.base)) (.cse27 (* 4 |lis_#in~N|)) (.cse32 (select |old(#valid)| |lis_#t~malloc1.base|)) (.cse33 (select |old(#valid)| |lis_#t~malloc0.base|)) (.cse29 (* 4 lis_~N)) (.cse34 (select |#length| lis_~a.base))) (let ((.cse0 (= 0 |lis_#t~malloc1.offset|)) (.cse1 (= 1 (select |#valid| lis_~prev~2.base))) (.cse14 (<= .cse29 .cse34)) (.cse2 (= (store (store |#valid| |lis_#t~malloc1.base| .cse32) |lis_#t~malloc0.base| .cse33) |old(#valid)|)) (.cse15 (<= .cse27 .cse34)) (.cse3 (= .cse29 .cse30)) (.cse4 (= (select (store |#valid| |lis_#t~malloc0.base| 0) |lis_#t~malloc0.base|) .cse33)) (.cse5 (= lis_~a.offset 0)) (.cse6 (not (= lis_~best~2.base |lis_#t~malloc1.base|))) (.cse7 (= 0 .cse32)) (.cse9 (= (select |#length| |lis_#t~malloc1.base|) .cse29)) (.cse8 (= lis_~prev~2.offset 0)) (.cse10 (= 1 (select |#valid| |lis_#t~malloc1.base|))) (.cse17 (= .cse29 (select |#length| lis_~prev~2.base))) (.cse26 (= .cse31 1)) (.cse11 (= 0 |lis_#t~malloc0.offset|)) (.cse12 (<= .cse27 (select |#length| |lis_#in~a.base|))) (.cse13 (= (select |#valid| |lis_#t~malloc0.base|) 1)) (.cse19 (= lis_~best~2.offset 0)) (.cse21 (= 1 (select |#valid| lis_~best~2.base))) (.cse23 (not (= |lis_#t~malloc0.base| |lis_#t~malloc1.base|))) (.cse28 (select |#length| |lis_#t~malloc0.base|))) (let ((.cse16 (= 1 .cse31)) (.cse18 (= 1 lis_~i~2)) (.cse20 (= .cse29 .cse28)) (.cse24 (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse3 (exists ((lis_~i~2 Int)) (and (<= 2 lis_~i~2) (<= (+ (* 4 lis_~i~2) lis_~best~2.offset 4) (select |#length| lis_~best~2.base)))) .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse17 .cse26 .cse11 .cse12 (<= 1 lis_~i~2) (= 1 (select |#valid| |lis_#in~a.base|)) .cse13 .cse19 .cse21 .cse23)) (.cse22 (<= (+ (* 4 lis_~i~2) lis_~best~2.offset 4) .cse30)) (.cse25 (= .cse28 .cse29))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= lis_~j~2 0) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= lis_~i~2 lis_~j~2) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (not (= (select |old(#valid)| |lis_#in~a.base|) 1)) (and (<= 2 lis_~j~2) .cse24 .cse22 .cse25) (and (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse17 .cse26 .cse11 .cse12 (<= 2 lis_~i~2) .cse13 .cse19 (= 0 lis_~j~2) .cse21 .cse23) .cse22 .cse25) (< (select |old(#length)| |lis_#in~a.base|) .cse27) (and (= 1 lis_~j~2) .cse24 .cse22 .cse25) (not (= 0 |lis_#in~a.offset|)) (< |lis_#in~N| 1))))) [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L548'(lines 548 550) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point lisErr19RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L549''''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L549''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point lisEXIT(lines 540 555) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point lisErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L549''''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,325 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point lisErr8RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L549'''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-29 22:42:52,326 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-29 22:42:52,327 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-29 22:42:52,327 INFO L399 ceAbstractionStarter]: For program point lisErr15RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,327 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-29 22:42:52,327 INFO L395 ceAbstractionStarter]: At program point L545'''''(lines 545 546) the Hoare annotation is: (let ((.cse23 (* 4 |lis_#in~N|)) (.cse24 (select |old(#valid)| |lis_#t~malloc1.base|)) (.cse25 (select |old(#valid)| |lis_#t~malloc0.base|)) (.cse17 (* 4 lis_~N)) (.cse26 (select |#length| lis_~a.base))) (let ((.cse0 (= 0 |lis_#t~malloc1.offset|)) (.cse1 (= 1 (select |#valid| lis_~prev~2.base))) (.cse2 (<= .cse17 .cse26)) (.cse3 (= (store (store |#valid| |lis_#t~malloc1.base| .cse24) |lis_#t~malloc0.base| .cse25) |old(#valid)|)) (.cse4 (<= .cse23 .cse26)) (.cse5 (= (select (store |#valid| |lis_#t~malloc0.base| 0) |lis_#t~malloc0.base|) .cse25)) (.cse6 (= lis_~a.offset 0)) (.cse7 (not (= lis_~best~2.base |lis_#t~malloc1.base|))) (.cse8 (= 0 .cse24)) (.cse9 (= lis_~prev~2.offset 0)) (.cse10 (= (select |#length| |lis_#t~malloc1.base|) .cse17)) (.cse11 (= 1 (select |#valid| |lis_#t~malloc1.base|))) (.cse12 (= .cse17 (select |#length| lis_~prev~2.base))) (.cse13 (= (select |#valid| lis_~a.base) 1)) (.cse14 (= 0 |lis_#t~malloc0.offset|)) (.cse15 (<= .cse23 (select |#length| |lis_#in~a.base|))) (.cse18 (= (select |#valid| |lis_#t~malloc0.base|) 1)) (.cse19 (= lis_~best~2.offset 0)) (.cse20 (= .cse17 (select |#length| |lis_#t~malloc0.base|))) (.cse16 (select |#length| lis_~best~2.base)) (.cse21 (= 1 (select |#valid| lis_~best~2.base))) (.cse22 (not (= |lis_#t~malloc0.base| |lis_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= .cse16 .cse17) .cse18 .cse19 (<= lis_~i~2 0) .cse20 .cse21 (<= 1 lis_~N) (<= 0 lis_~i~2) .cse22) (< (select |old(#length)| |lis_#in~a.base|) .cse23) (not (= (select |old(#valid)| |lis_#in~a.base|) 1)) (not (= 0 |lis_#in~a.offset|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse17 .cse16) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 1 lis_~i~2) .cse18 .cse19 .cse20 (<= (+ (* 4 lis_~i~2) lis_~best~2.offset) .cse16) .cse21 .cse22) (< |lis_#in~N| 1)))) [2018-01-29 22:42:52,327 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-29 22:42:52,327 INFO L399 ceAbstractionStarter]: For program point lisErr10RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,328 INFO L395 ceAbstractionStarter]: At program point L551'''''(lines 551 553) the Hoare annotation is: (let ((.cse26 (select |#valid| lis_~a.base)) (.cse27 (* 4 |lis_#in~N|)) (.cse32 (select |old(#valid)| |lis_#t~malloc1.base|)) (.cse33 (select |old(#valid)| |lis_#t~malloc0.base|)) (.cse34 (select |#length| lis_~a.base)) (.cse31 (select |#length| lis_~best~2.base)) (.cse30 (* 4 lis_~N))) (let ((.cse17 (= .cse31 .cse30)) (.cse22 (<= 0 lis_~i~2)) (.cse23 (<= (+ (* 4 lis_~i~2) lis_~best~2.offset 4) .cse31)) (.cse25 (<= 2 lis_~j~2)) (.cse1 (= 0 |lis_#t~malloc1.offset|)) (.cse0 (<= lis_~N 2)) (.cse2 (= 1 (select |#valid| lis_~prev~2.base))) (.cse3 (<= .cse30 .cse34)) (.cse4 (= (store (store |#valid| |lis_#t~malloc1.base| .cse32) |lis_#t~malloc0.base| .cse33) |old(#valid)|)) (.cse5 (<= .cse27 .cse34)) (.cse28 (= .cse30 .cse31)) (.cse6 (= (select (store |#valid| |lis_#t~malloc0.base| 0) |lis_#t~malloc0.base|) .cse33)) (.cse7 (= lis_~a.offset 0)) (.cse8 (not (= lis_~best~2.base |lis_#t~malloc1.base|))) (.cse9 (= 0 .cse32)) (.cse10 (= lis_~prev~2.offset 0)) (.cse11 (= (select |#length| |lis_#t~malloc1.base|) .cse30)) (.cse12 (= 1 (select |#valid| |lis_#t~malloc1.base|))) (.cse13 (= .cse30 (select |#length| lis_~prev~2.base))) (.cse14 (= .cse26 1)) (.cse15 (= 0 |lis_#t~malloc0.offset|)) (.cse16 (<= .cse27 (select |#length| |lis_#in~a.base|))) (.cse29 (<= (+ lis_~best~2.offset 8) .cse31)) (.cse18 (= (select |#valid| |lis_#t~malloc0.base|) 1)) (.cse19 (= lis_~best~2.offset 0)) (.cse20 (= .cse30 (select |#length| |lis_#t~malloc0.base|))) (.cse21 (= 1 (select |#valid| lis_~best~2.base))) (.cse24 (not (= |lis_#t~malloc0.base| |lis_#t~malloc1.base|)))) (or (not (= (select |old(#valid)| |lis_#in~a.base|) 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse25 .cse3 .cse5 (= 1 .cse26) .cse13 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (< (select |old(#length)| |lis_#in~a.base|) .cse27) (not (= 0 |lis_#in~a.offset|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_3 Int)) (and (<= 0 (+ (* 4 v_prenex_3) lis_~best~2.offset)) (<= (+ v_prenex_3 1) lis_~i~2))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse18 .cse19 .cse20 .cse25 .cse21 .cse24) (and .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 (<= lis_~i~2 1) .cse7 .cse8 .cse9 (<= lis_~N 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 1 lis_~i~2) .cse18 .cse19 .cse20 .cse21 (<= 1 lis_~N) .cse24) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse18 (<= 2 lis_~i~2) .cse19 .cse20 .cse21 .cse24) (< |lis_#in~N| 1)))) [2018-01-29 22:42:52,328 INFO L399 ceAbstractionStarter]: For program point L551'''(line 551) no Hoare annotation was computed. [2018-01-29 22:42:52,328 INFO L399 ceAbstractionStarter]: For program point lisErr13RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,328 INFO L399 ceAbstractionStarter]: For program point lisErr21RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,328 INFO L399 ceAbstractionStarter]: For program point L549'''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,328 INFO L399 ceAbstractionStarter]: For program point L548'''(lines 548 550) no Hoare annotation was computed. [2018-01-29 22:42:52,328 INFO L399 ceAbstractionStarter]: For program point L551''''(line 551) no Hoare annotation was computed. [2018-01-29 22:42:52,328 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,328 INFO L399 ceAbstractionStarter]: For program point L547''''''(lines 547 550) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point lisErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point L550'''(line 550) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point L551''''''(lines 551 553) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point lisErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point L549'''''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point L549'''''''''''''(line 549) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point lisErr11RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,329 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L395 ceAbstractionStarter]: At program point lisENTRY(lines 540 555) the Hoare annotation is: (let ((.cse0 (* 4 |lis_#in~N|))) (or (and (= |#valid| |old(#valid)|) (<= .cse0 (select |#length| |lis_#in~a.base|))) (< (select |old(#length)| |lis_#in~a.base|) .cse0) (not (= (select |old(#valid)| |lis_#in~a.base|) 1)) (not (= 0 |lis_#in~a.offset|)) (< |lis_#in~N| 1))) [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point lisErr14RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L545''''''(lines 545 546) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point lisErr9RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point lisErr6RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L545'(lines 545 546) no Hoare annotation was computed. [2018-01-29 22:42:52,330 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-29 22:42:52,331 INFO L399 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-29 22:42:52,331 INFO L395 ceAbstractionStarter]: At program point L547'''''(lines 547 550) the Hoare annotation is: (let ((.cse23 (* 4 |lis_#in~N|)) (.cse27 (select |old(#valid)| |lis_#t~malloc1.base|)) (.cse28 (select |old(#valid)| |lis_#t~malloc0.base|)) (.cse26 (* 4 lis_~N)) (.cse29 (select |#length| lis_~a.base)) (.cse25 (* 4 lis_~i~2)) (.cse24 (select |#length| lis_~best~2.base))) (let ((.cse21 (<= (+ .cse25 lis_~best~2.offset 4) .cse24)) (.cse0 (= 0 |lis_#t~malloc1.offset|)) (.cse1 (= 1 (select |#valid| lis_~prev~2.base))) (.cse2 (<= .cse26 .cse29)) (.cse3 (= (store (store |#valid| |lis_#t~malloc1.base| .cse27) |lis_#t~malloc0.base| .cse28) |old(#valid)|)) (.cse4 (<= .cse23 .cse29)) (.cse5 (= .cse26 .cse24)) (.cse6 (= (select (store |#valid| |lis_#t~malloc0.base| 0) |lis_#t~malloc0.base|) .cse28)) (.cse7 (= lis_~a.offset 0)) (.cse8 (not (= lis_~best~2.base |lis_#t~malloc1.base|))) (.cse9 (= 0 .cse27)) (.cse10 (= lis_~prev~2.offset 0)) (.cse11 (= (select |#length| |lis_#t~malloc1.base|) .cse26)) (.cse12 (= 1 (select |#valid| |lis_#t~malloc1.base|))) (.cse13 (= .cse26 (select |#length| lis_~prev~2.base))) (.cse14 (= (select |#valid| lis_~a.base) 1)) (.cse15 (= 0 |lis_#t~malloc0.offset|)) (.cse16 (<= .cse23 (select |#length| |lis_#in~a.base|))) (.cse17 (= (select |#valid| |lis_#t~malloc0.base|) 1)) (.cse18 (= lis_~best~2.offset 0)) (.cse19 (= .cse26 (select |#length| |lis_#t~malloc0.base|))) (.cse20 (= 1 (select |#valid| lis_~best~2.base))) (.cse22 (not (= |lis_#t~malloc0.base| |lis_#t~malloc1.base|)))) (or (and .cse0 .cse1 (<= 1 lis_~j~2) .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 lis_~i~2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 1 lis_~i~2) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (< (select |old(#length)| |lis_#in~a.base|) .cse23) (not (= (select |old(#valid)| |lis_#in~a.base|) 1)) (not (= 0 |lis_#in~a.offset|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ lis_~best~2.offset 12) .cse24) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 2 lis_~i~2) .cse17 .cse18 .cse19 (<= 2 lis_~j~2) .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= lis_~i~2 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= (+ .cse25 lis_~best~2.offset) .cse24) .cse20 (<= 1 lis_~N) (<= lis_~N lis_~i~2) .cse22) (< |lis_#in~N| 1)))) [2018-01-29 22:42:52,331 INFO L399 ceAbstractionStarter]: For program point lisErr17RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,331 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-29 22:42:52,331 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,331 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-29 22:42:52,331 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:42:52,331 INFO L399 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-29 22:42:52,331 INFO L399 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-29 22:42:52,331 INFO L395 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~7))) (and (= .cse0 (select |#length| |main_#t~malloc19.base|)) (= .cse0 (select |#length| main_~numbers~7.base)) (= 0 main_~numbers~7.offset) (= 0 |main_#t~malloc19.offset|) (= 1 (select |#valid| |main_#t~malloc19.base|)) (<= 1 main_~array_size~7) (= |old(#valid)| (store |#valid| |main_#t~malloc19.base| 0)) (= 1 (select |#valid| main_~numbers~7.base)))) [2018-01-29 22:42:52,331 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-29 22:42:52,331 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 556 563) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point L558(lines 558 560) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 556 563) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 556 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point L561''(line 561) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point L558''(lines 558 560) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point L562'''(line 562) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-29 22:42:52,332 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 556 563) no Hoare annotation was computed. [2018-01-29 22:42:52,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-29 22:42:52,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-29 22:42:52,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,354 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,354 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,355 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,355 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,355 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,355 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,360 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,360 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,360 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,360 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,360 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-29 22:42:52,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-29 22:42:52,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,385 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,385 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,385 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,385 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,387 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,387 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,387 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,387 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,399 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,400 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,401 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,402 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,402 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,402 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,403 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,403 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,403 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,403 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,404 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,404 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,404 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,404 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,405 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,405 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,405 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,406 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,406 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,406 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,406 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,407 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,407 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,407 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,413 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,415 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,415 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,415 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,415 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,416 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,416 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,416 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,417 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,417 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,417 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,417 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,419 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,419 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,419 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,420 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,423 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,424 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,425 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,426 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,426 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,426 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,426 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,426 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,428 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,428 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,431 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,432 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,432 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,432 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,438 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,439 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,439 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,441 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,441 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,441 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,443 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,443 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,443 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,443 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,444 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,444 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,444 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,447 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,447 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,447 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,448 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,448 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,448 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,448 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,448 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,450 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,450 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,450 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,451 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,451 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,456 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,456 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,460 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,460 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,460 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,461 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,461 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,461 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,461 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,462 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,462 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,462 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,463 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,463 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,463 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,463 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,467 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,467 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,467 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,468 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,468 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,468 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,468 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:42:52 BoogieIcfgContainer [2018-01-29 22:42:52,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:42:52,472 INFO L168 Benchmark]: Toolchain (without parser) took 23311.34 ms. Allocated memory was 295.7 MB in the beginning and 709.9 MB in the end (delta: 414.2 MB). Free memory was 255.7 MB in the beginning and 482.6 MB in the end (delta: -226.8 MB). Peak memory consumption was 390.3 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:52,473 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 295.7 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:42:52,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.00 ms. Allocated memory is still 295.7 MB. Free memory was 254.7 MB in the beginning and 244.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:52,474 INFO L168 Benchmark]: Boogie Preprocessor took 32.58 ms. Allocated memory is still 295.7 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:52,474 INFO L168 Benchmark]: RCFGBuilder took 462.04 ms. Allocated memory is still 295.7 MB. Free memory was 242.7 MB in the beginning and 215.0 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:52,475 INFO L168 Benchmark]: TraceAbstraction took 22604.80 ms. Allocated memory was 295.7 MB in the beginning and 709.9 MB in the end (delta: 414.2 MB). Free memory was 215.0 MB in the beginning and 482.6 MB in the end (delta: -267.5 MB). Peak memory consumption was 349.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:42:52,477 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 295.7 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.00 ms. Allocated memory is still 295.7 MB. Free memory was 254.7 MB in the beginning and 244.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.58 ms. Allocated memory is still 295.7 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 462.04 ms. Allocated memory is still 295.7 MB. Free memory was 242.7 MB in the beginning and 215.0 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22604.80 ms. Allocated memory was 295.7 MB in the beginning and 709.9 MB in the end (delta: 414.2 MB). Free memory was 215.0 MB in the beginning and 482.6 MB in the end (delta: -267.5 MB). Peak memory consumption was 349.6 MB. Max. memory is 5.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_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - InvariantResult [Line: 551]: Loop Invariant [2018-01-29 22:42:52,490 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-29 22:42:52,490 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-29 22:42:52,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,492 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,492 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,492 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,492 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,493 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,493 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,493 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,493 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,494 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,494 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,494 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,494 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,495 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,495 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,495 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,495 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,495 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,496 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,496 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,496 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,497 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,497 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,497 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,497 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,497 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,498 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,499 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,499 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,499 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,499 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,500 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,500 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,500 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,503 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-29 22:42:52,504 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-29 22:42:52,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,511 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,511 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,511 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,511 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(\old(\valid)[a] == 1) || ((((((((((((((((((((((((N <= 2 && 0 == __builtin_alloca (sizeof(int) * N)) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && unknown-#length-unknown[best] == 4 * N) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && 0 <= i) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || ((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && unknown-#length-unknown[best] == 4 * N) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && 2 <= j) && 4 * N <= unknown-#length-unknown[a]) && 4 * \old(N) <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * N == unknown-#length-unknown[prev]) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && 0 <= i) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || \old(unknown-#length-unknown)[a] < 4 * \old(N)) || !(0 == a)) || ((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && (\exists v_prenex_3 : int :: 0 <= 4 * v_prenex_3 + best && v_prenex_3 + 1 <= i)) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && best + 8 <= unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 2 <= j) && 1 == \valid[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || ((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && i <= 1) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && N <= 1) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 1 <= i) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && 1 <= N) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || ((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && N <= 2) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && best + 8 <= unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && 2 <= i) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || \old(N) < 1 - InvariantResult [Line: 547]: Loop Invariant [2018-01-29 22:42:52,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,519 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,519 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,519 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,520 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,520 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,520 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,520 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,520 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,521 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,521 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,521 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,521 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,522 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,522 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,522 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,522 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,522 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,527 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,529 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,529 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,529 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,529 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,530 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,530 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,530 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,530 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 1 <= j) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && 2 == i) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N))) || (((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 1 == i) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || \old(unknown-#length-unknown)[a] < 4 * \old(N)) || !(\old(\valid)[a] == 1)) || !(0 == a)) || ((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && best + 12 <= unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 2 <= i) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 2 <= j) && 1 == \valid[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || (((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && i <= 2) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 4 * i + best <= unknown-#length-unknown[best]) && 1 == \valid[best]) && 1 <= N) && N <= i) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || \old(N) < 1 - InvariantResult [Line: 545]: Loop Invariant [2018-01-29 22:42:52,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && unknown-#length-unknown[best] == 4 * N) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && i <= 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && 1 <= N) && 0 <= i) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N))) || \old(unknown-#length-unknown)[a] < 4 * \old(N)) || !(\old(\valid)[a] == 1)) || !(0 == a)) || (((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 1 <= i) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 4 * i + best <= unknown-#length-unknown[best]) && 1 == \valid[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || \old(N) < 1 - InvariantResult [Line: 548]: Loop Invariant [2018-01-29 22:42:52,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-29 22:42:52,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,571 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,572 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,574 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,574 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,574 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:42:52,574 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && 4 * N <= unknown-#length-unknown[a]) && 4 * \old(N) <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * N == unknown-#length-unknown[prev]) && j == 0) && 1 == i) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N))) || ((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && prev == 0) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && 4 * N <= unknown-#length-unknown[a]) && 4 * \old(N) <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * N == unknown-#length-unknown[prev]) && i <= j) && 1 == i) && best == 0) && 4 * N == unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)]) && 1 == \valid[best]) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N)))) || !(\old(\valid)[a] == 1)) || (((2 <= j && ((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && (\exists lis_~i~2 : int :: 2 <= lis_~i~2 && 4 * lis_~i~2 + best + 4 <= unknown-#length-unknown[best])) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && prev == 0) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 1 <= i) && 1 == \valid[a]) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 1 == \valid[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N))) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N)) || ((((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && prev == 0) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 2 <= i) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 0 == j) && 1 == \valid[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N))) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N)) || \old(unknown-#length-unknown)[a] < 4 * \old(N)) || (((1 == j && ((((((((((((((((((((((0 == __builtin_alloca (sizeof(int) * N) && 1 == \valid[prev]) && 4 * N <= unknown-#length-unknown[a]) && \valid[__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]][__builtin_alloca (sizeof(int) * N) := \old(\valid)[__builtin_alloca (sizeof(int) * N)]] == \old(\valid)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 4 * N == unknown-#length-unknown[best]) && (\exists lis_~i~2 : int :: 2 <= lis_~i~2 && 4 * lis_~i~2 + best + 4 <= unknown-#length-unknown[best])) && \valid[__builtin_alloca (sizeof(int) * N) := 0][__builtin_alloca (sizeof(int) * N)] == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && a == 0) && !(best == __builtin_alloca (sizeof(int) * N))) && 0 == \old(\valid)[__builtin_alloca (sizeof(int) * N)]) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N) && prev == 0) && 1 == \valid[__builtin_alloca (sizeof(int) * N)]) && 4 * N == unknown-#length-unknown[prev]) && \valid[a] == 1) && 0 == __builtin_alloca (sizeof(int) * N)) && 4 * \old(N) <= unknown-#length-unknown[a]) && 1 <= i) && 1 == \valid[a]) && \valid[__builtin_alloca (sizeof(int) * N)] == 1) && best == 0) && 1 == \valid[best]) && !(__builtin_alloca (sizeof(int) * N) == __builtin_alloca (sizeof(int) * N))) && 4 * i + best + 4 <= unknown-#length-unknown[best]) && unknown-#length-unknown[__builtin_alloca (sizeof(int) * N)] == 4 * N)) || !(0 == a)) || \old(N) < 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 119 locations, 23 error locations. SAFE Result, 22.4s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1904 SDtfs, 9207 SDslu, 9991 SDs, 0 SdLazy, 5712 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 860 SyntacticMatches, 8 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2866 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 570 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 40 NumberOfFragments, 2468 HoareAnnotationTreeSize, 10 FomulaSimplifications, 52929 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 10 FomulaSimplificationsInter, 16702 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2219 NumberOfCodeBlocks, 2092 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2186 ConstructedInterpolants, 228 QuantifiedInterpolants, 1325944 SizeOfPredicates, 76 NumberOfNonLiveVariables, 2052 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 33 InterpolantComputations, 12 PerfectInterpolantSequences, 652/933 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-42-52-582.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-42-52-582.csv Received shutdown request...