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-acfac67 [2018-01-28 21:07:07,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:07:07,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:07:07,202 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:07:07,202 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:07:07,203 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:07:07,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:07:07,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:07:07,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:07:07,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:07:07,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:07:07,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:07:07,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:07:07,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:07:07,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:07:07,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:07:07,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:07:07,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:07:07,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:07:07,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:07:07,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:07:07,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:07:07,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:07:07,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:07:07,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:07:07,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:07:07,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:07:07,228 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:07:07,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:07:07,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:07:07,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:07:07,230 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-28 21:07:07,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:07:07,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:07:07,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:07:07,241 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:07:07,241 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:07:07,242 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:07:07,242 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:07:07,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:07:07,243 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:07:07,243 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:07:07,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:07:07,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:07:07,244 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:07:07,244 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:07:07,244 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:07:07,244 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:07:07,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:07:07,245 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:07:07,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:07:07,245 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:07:07,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:07:07,245 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:07:07,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:07:07,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:07:07,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:07:07,246 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:07:07,247 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:07:07,247 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:07:07,247 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:07:07,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:07:07,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:07:07,248 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:07:07,248 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:07:07,249 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:07:07,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:07:07,299 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:07:07,303 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:07:07,305 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:07:07,305 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:07:07,306 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-28 21:07:07,524 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:07:07,531 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:07:07,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:07:07,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:07:07,540 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:07:07,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5e2bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07, skipping insertion in model container [2018-01-28 21:07:07,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,565 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:07:07,606 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:07:07,740 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:07:07,759 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:07:07,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07 WrapperNode [2018-01-28 21:07:07,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:07:07,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:07:07,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:07:07,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:07:07,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (1/1) ... [2018-01-28 21:07:07,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:07:07,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:07:07,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:07:07,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:07:07,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (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-28 21:07:07,863 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:07:07,863 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:07:07,863 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-28 21:07:07,863 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:07:07,863 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:07:07,863 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:07:07,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:07:07,864 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:07:07,864 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:07:07,864 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:07:07,864 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-28 21:07:07,864 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:07:07,864 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:07:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:07:08,255 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:07:08,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:07:08 BoogieIcfgContainer [2018-01-28 21:07:08,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:07:08,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:07:08,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:07:08,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:07:08,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:07:07" (1/3) ... [2018-01-28 21:07:08,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d686f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:07:08, skipping insertion in model container [2018-01-28 21:07:08,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:07:07" (2/3) ... [2018-01-28 21:07:08,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d686f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:07:08, skipping insertion in model container [2018-01-28 21:07:08,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:07:08" (3/3) ... [2018-01-28 21:07:08,266 INFO L107 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:07:08,274 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:07:08,282 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-28 21:07:08,323 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:07:08,323 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:07:08,324 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:07:08,324 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:07:08,324 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:07:08,324 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:07:08,324 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:07:08,324 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:07:08,325 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:07:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-28 21:07:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:07:08,349 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:08,350 INFO L330 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-28 21:07:08,351 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-28 21:07:08,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1908139925, now seen corresponding path program 1 times [2018-01-28 21:07:08,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:08,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:08,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:08,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:08,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:08,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:08,597 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-28 21:07:08,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:08,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:07:08,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:07:08,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:07:08,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:07:08,692 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 4 states. [2018-01-28 21:07:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:08,877 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2018-01-28 21:07:08,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:07:08,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-28 21:07:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:08,890 INFO L225 Difference]: With dead ends: 195 [2018-01-28 21:07:08,890 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 21:07:08,894 INFO L533 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-28 21:07:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 21:07:08,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-01-28 21:07:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-28 21:07:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-28 21:07:08,931 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 28 [2018-01-28 21:07:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:08,931 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-28 21:07:08,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:07:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-28 21:07:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:07:08,932 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:08,932 INFO L330 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-28 21:07:08,933 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-28 21:07:08,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1908139926, now seen corresponding path program 1 times [2018-01-28 21:07:08,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:08,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:08,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:08,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:08,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:08,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:09,210 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-28 21:07:09,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:09,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:07:09,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:07:09,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:07:09,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:07:09,213 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 10 states. [2018-01-28 21:07:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:09,564 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2018-01-28 21:07:09,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:07:09,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-01-28 21:07:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:09,566 INFO L225 Difference]: With dead ends: 202 [2018-01-28 21:07:09,567 INFO L226 Difference]: Without dead ends: 128 [2018-01-28 21:07:09,568 INFO L533 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-28 21:07:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-28 21:07:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2018-01-28 21:07:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-28 21:07:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-28 21:07:09,581 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 28 [2018-01-28 21:07:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:09,581 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-28 21:07:09,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:07:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-28 21:07:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:07:09,583 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:09,583 INFO L330 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-28 21:07:09,583 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-28 21:07:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash -977204472, now seen corresponding path program 1 times [2018-01-28 21:07:09,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:09,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:09,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:09,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:09,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:09,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:09,641 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-28 21:07:09,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:09,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:07:09,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:07:09,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:07:09,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:07:09,643 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 4 states. [2018-01-28 21:07:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:09,735 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-01-28 21:07:09,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:07:09,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-28 21:07:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:09,736 INFO L225 Difference]: With dead ends: 118 [2018-01-28 21:07:09,736 INFO L226 Difference]: Without dead ends: 116 [2018-01-28 21:07:09,737 INFO L533 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-28 21:07:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-28 21:07:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-28 21:07:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 21:07:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-01-28 21:07:09,746 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 29 [2018-01-28 21:07:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:09,746 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-01-28 21:07:09,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:07:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-01-28 21:07:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:07:09,747 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:09,747 INFO L330 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-28 21:07:09,747 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-28 21:07:09,747 INFO L82 PathProgramCache]: Analyzing trace with hash -977204471, now seen corresponding path program 1 times [2018-01-28 21:07:09,748 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:09,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:09,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:09,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:09,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:09,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:09,879 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-28 21:07:09,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:09,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:07:09,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:07:09,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:07:09,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:07:09,880 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 8 states. [2018-01-28 21:07:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:10,191 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-01-28 21:07:10,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:07:10,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-28 21:07:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:10,193 INFO L225 Difference]: With dead ends: 148 [2018-01-28 21:07:10,193 INFO L226 Difference]: Without dead ends: 146 [2018-01-28 21:07:10,193 INFO L533 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-28 21:07:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-28 21:07:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2018-01-28 21:07:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-28 21:07:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-01-28 21:07:10,204 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 29 [2018-01-28 21:07:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:10,205 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-01-28 21:07:10,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:07:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-01-28 21:07:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 21:07:10,206 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:10,206 INFO L330 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-28 21:07:10,207 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-28 21:07:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1049680860, now seen corresponding path program 1 times [2018-01-28 21:07:10,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:10,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:10,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:10,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:10,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:10,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:10,436 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-28 21:07:10,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:10,436 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-28 21:07:10,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:10,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:10,508 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-28 21:07:10,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:10,517 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-28 21:07:10,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:10,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:07:10,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-28 21:07:10,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:07:10,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:07:10,556 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-28 21:07:10,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:10,577 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-28 21:07:10,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:10,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:07:10,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-28 21:07:10,792 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-28 21:07:10,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:10,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-01-28 21:07:10,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 21:07:10,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 21:07:10,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:07:10,814 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 15 states. [2018-01-28 21:07:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:11,594 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2018-01-28 21:07:11,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 21:07:11,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-01-28 21:07:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:11,595 INFO L225 Difference]: With dead ends: 196 [2018-01-28 21:07:11,595 INFO L226 Difference]: Without dead ends: 193 [2018-01-28 21:07:11,596 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:07:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-28 21:07:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 142. [2018-01-28 21:07:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-28 21:07:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-01-28 21:07:11,608 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 35 [2018-01-28 21:07:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:11,608 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-01-28 21:07:11,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 21:07:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-01-28 21:07:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:07:11,609 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:11,609 INFO L330 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-28 21:07:11,609 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-28 21:07:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1003669364, now seen corresponding path program 1 times [2018-01-28 21:07:11,609 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:11,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:11,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:11,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:11,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:11,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:11,764 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-28 21:07:11,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:11,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:07:11,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:07:11,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:07:11,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:07:11,765 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 11 states. [2018-01-28 21:07:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:11,844 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2018-01-28 21:07:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:07:11,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-28 21:07:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:11,845 INFO L225 Difference]: With dead ends: 142 [2018-01-28 21:07:11,845 INFO L226 Difference]: Without dead ends: 140 [2018-01-28 21:07:11,846 INFO L533 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-28 21:07:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-28 21:07:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-28 21:07:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-28 21:07:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2018-01-28 21:07:11,858 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 41 [2018-01-28 21:07:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:11,859 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2018-01-28 21:07:11,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:07:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2018-01-28 21:07:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:07:11,860 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:11,860 INFO L330 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-28 21:07:11,860 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-28 21:07:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1003669365, now seen corresponding path program 1 times [2018-01-28 21:07:11,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:11,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:11,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:11,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:11,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:11,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:11,993 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-28 21:07:11,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:11,993 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-28 21:07:12,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:12,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:12,215 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-28 21:07:12,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:12,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-01-28 21:07:12,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:07:12,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:07:12,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:07:12,237 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 10 states. [2018-01-28 21:07:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:12,442 INFO L93 Difference]: Finished difference Result 301 states and 331 transitions. [2018-01-28 21:07:12,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:07:12,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-28 21:07:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:12,449 INFO L225 Difference]: With dead ends: 301 [2018-01-28 21:07:12,449 INFO L226 Difference]: Without dead ends: 199 [2018-01-28 21:07:12,450 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:07:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-28 21:07:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 150. [2018-01-28 21:07:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-28 21:07:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2018-01-28 21:07:12,463 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 41 [2018-01-28 21:07:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:12,464 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2018-01-28 21:07:12,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:07:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2018-01-28 21:07:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 21:07:12,465 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:12,465 INFO L330 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-28 21:07:12,465 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-28 21:07:12,466 INFO L82 PathProgramCache]: Analyzing trace with hash 240088303, now seen corresponding path program 2 times [2018-01-28 21:07:12,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:12,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:12,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:12,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:12,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:12,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:12,720 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-28 21:07:12,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:12,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:07:12,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:07:12,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:07:12,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:07:12,721 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand 11 states. [2018-01-28 21:07:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:13,061 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2018-01-28 21:07:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:07:13,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-01-28 21:07:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:13,063 INFO L225 Difference]: With dead ends: 209 [2018-01-28 21:07:13,063 INFO L226 Difference]: Without dead ends: 207 [2018-01-28 21:07:13,063 INFO L533 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-28 21:07:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-28 21:07:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 157. [2018-01-28 21:07:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-28 21:07:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2018-01-28 21:07:13,073 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 48 [2018-01-28 21:07:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:13,073 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2018-01-28 21:07:13,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:07:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2018-01-28 21:07:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:07:13,074 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:13,075 INFO L330 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-28 21:07:13,075 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-28 21:07:13,075 INFO L82 PathProgramCache]: Analyzing trace with hash -930738850, now seen corresponding path program 1 times [2018-01-28 21:07:13,075 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:13,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:13,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:13,076 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:07:13,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:13,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:13,162 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-28 21:07:13,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:13,163 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-28 21:07:13,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:13,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:13,264 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-28 21:07:13,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:13,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-01-28 21:07:13,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 21:07:13,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 21:07:13,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:07:13,301 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand 14 states. [2018-01-28 21:07:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:13,555 INFO L93 Difference]: Finished difference Result 222 states and 240 transitions. [2018-01-28 21:07:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:07:13,556 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-01-28 21:07:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:13,557 INFO L225 Difference]: With dead ends: 222 [2018-01-28 21:07:13,557 INFO L226 Difference]: Without dead ends: 194 [2018-01-28 21:07:13,558 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-01-28 21:07:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-28 21:07:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 172. [2018-01-28 21:07:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-28 21:07:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 191 transitions. [2018-01-28 21:07:13,567 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 191 transitions. Word has length 49 [2018-01-28 21:07:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:13,568 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 191 transitions. [2018-01-28 21:07:13,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 21:07:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 191 transitions. [2018-01-28 21:07:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:07:13,569 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:13,569 INFO L330 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-28 21:07:13,569 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-28 21:07:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash 353418487, now seen corresponding path program 1 times [2018-01-28 21:07:13,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:13,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:13,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:13,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:13,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:13,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:13,693 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-28 21:07:13,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:13,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:07:13,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:07:13,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:07:13,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:07:13,694 INFO L87 Difference]: Start difference. First operand 172 states and 191 transitions. Second operand 11 states. [2018-01-28 21:07:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:13,856 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2018-01-28 21:07:13,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:07:13,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-01-28 21:07:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:13,859 INFO L225 Difference]: With dead ends: 204 [2018-01-28 21:07:13,860 INFO L226 Difference]: Without dead ends: 202 [2018-01-28 21:07:13,860 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:07:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-28 21:07:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2018-01-28 21:07:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 21:07:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2018-01-28 21:07:13,873 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 53 [2018-01-28 21:07:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:13,874 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2018-01-28 21:07:13,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:07:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2018-01-28 21:07:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 21:07:13,875 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:13,875 INFO L330 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-28 21:07:13,875 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-28 21:07:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1031396761, now seen corresponding path program 1 times [2018-01-28 21:07:13,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:13,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:13,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:13,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:13,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:13,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:13,913 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-28 21:07:13,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:13,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:07:13,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:07:13,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:07:13,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:07:13,914 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand 3 states. [2018-01-28 21:07:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:13,946 INFO L93 Difference]: Finished difference Result 289 states and 322 transitions. [2018-01-28 21:07:13,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:07:13,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-28 21:07:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:13,948 INFO L225 Difference]: With dead ends: 289 [2018-01-28 21:07:13,948 INFO L226 Difference]: Without dead ends: 172 [2018-01-28 21:07:13,948 INFO L533 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-28 21:07:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-28 21:07:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-28 21:07:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-28 21:07:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-01-28 21:07:13,961 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 58 [2018-01-28 21:07:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:13,961 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-01-28 21:07:13,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:07:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-01-28 21:07:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 21:07:13,963 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:13,963 INFO L330 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-28 21:07:13,963 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-28 21:07:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1920877196, now seen corresponding path program 1 times [2018-01-28 21:07:13,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:13,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:13,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:13,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:13,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:13,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:14,082 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-28 21:07:14,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:14,082 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-28 21:07:14,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:14,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:14,168 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-28 21:07:14,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:07:14,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2018-01-28 21:07:14,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 21:07:14,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 21:07:14,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:07:14,189 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 13 states. [2018-01-28 21:07:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:14,525 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2018-01-28 21:07:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:07:14,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-01-28 21:07:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:14,526 INFO L225 Difference]: With dead ends: 342 [2018-01-28 21:07:14,527 INFO L226 Difference]: Without dead ends: 266 [2018-01-28 21:07:14,528 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-01-28 21:07:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-28 21:07:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 220. [2018-01-28 21:07:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-28 21:07:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2018-01-28 21:07:14,540 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 60 [2018-01-28 21:07:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:14,541 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2018-01-28 21:07:14,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 21:07:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2018-01-28 21:07:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 21:07:14,542 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:14,542 INFO L330 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-28 21:07:14,542 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-28 21:07:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash 993444599, now seen corresponding path program 1 times [2018-01-28 21:07:14,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:14,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:14,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:14,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:14,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:14,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:14,849 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-28 21:07:14,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:07:14,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:07:14,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:07:14,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:07:14,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:07:14,851 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 8 states. [2018-01-28 21:07:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:14,979 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2018-01-28 21:07:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:07:14,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-28 21:07:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:14,980 INFO L225 Difference]: With dead ends: 220 [2018-01-28 21:07:14,980 INFO L226 Difference]: Without dead ends: 188 [2018-01-28 21:07:14,981 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:07:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-28 21:07:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-01-28 21:07:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-28 21:07:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 206 transitions. [2018-01-28 21:07:14,997 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 206 transitions. Word has length 61 [2018-01-28 21:07:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:14,998 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 206 transitions. [2018-01-28 21:07:14,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:07:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2018-01-28 21:07:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-28 21:07:15,009 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:15,009 INFO L330 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-28 21:07:15,010 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-28 21:07:15,011 INFO L82 PathProgramCache]: Analyzing trace with hash 390335828, now seen corresponding path program 1 times [2018-01-28 21:07:15,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:15,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:15,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:15,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:15,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:15,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:15,105 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-28 21:07:15,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:15,106 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-28 21:07:15,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:15,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:15,192 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-28 21:07:15,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:07:15,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-28 21:07:15,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:07:15,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:07:15,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:07:15,224 INFO L87 Difference]: Start difference. First operand 188 states and 206 transitions. Second operand 10 states. [2018-01-28 21:07:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:15,397 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2018-01-28 21:07:15,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:07:15,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-01-28 21:07:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:15,398 INFO L225 Difference]: With dead ends: 314 [2018-01-28 21:07:15,398 INFO L226 Difference]: Without dead ends: 191 [2018-01-28 21:07:15,398 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:07:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-28 21:07:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 184. [2018-01-28 21:07:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-28 21:07:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 198 transitions. [2018-01-28 21:07:15,413 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 198 transitions. Word has length 64 [2018-01-28 21:07:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:15,414 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 198 transitions. [2018-01-28 21:07:15,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:07:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 198 transitions. [2018-01-28 21:07:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-28 21:07:15,415 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:15,415 INFO L330 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-28 21:07:15,415 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-28 21:07:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1083282026, now seen corresponding path program 1 times [2018-01-28 21:07:15,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:15,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:15,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:15,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:15,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:15,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:15,561 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-28 21:07:15,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:15,561 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-28 21:07:15,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:15,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:15,752 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-28 21:07:15,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:15,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-28 21:07:15,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 21:07:15,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 21:07:15,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-28 21:07:15,780 INFO L87 Difference]: Start difference. First operand 184 states and 198 transitions. Second operand 20 states. [2018-01-28 21:07:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:16,179 INFO L93 Difference]: Finished difference Result 225 states and 242 transitions. [2018-01-28 21:07:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 21:07:16,179 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-01-28 21:07:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:16,180 INFO L225 Difference]: With dead ends: 225 [2018-01-28 21:07:16,180 INFO L226 Difference]: Without dead ends: 223 [2018-01-28 21:07:16,181 INFO L533 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-28 21:07:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-28 21:07:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-01-28 21:07:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-28 21:07:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2018-01-28 21:07:16,198 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 79 [2018-01-28 21:07:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:16,198 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2018-01-28 21:07:16,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 21:07:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2018-01-28 21:07:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-28 21:07:16,199 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:16,200 INFO L330 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-28 21:07:16,200 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-28 21:07:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash 615914539, now seen corresponding path program 1 times [2018-01-28 21:07:16,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:16,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:16,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:16,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:16,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:16,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:16,358 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-28 21:07:16,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:16,358 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-28 21:07:16,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:16,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:16,602 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-28 21:07:16,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:16,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-01-28 21:07:16,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 21:07:16,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 21:07:16,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-01-28 21:07:16,637 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand 23 states. [2018-01-28 21:07:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:17,662 INFO L93 Difference]: Finished difference Result 291 states and 319 transitions. [2018-01-28 21:07:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 21:07:17,663 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-01-28 21:07:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:17,664 INFO L225 Difference]: With dead ends: 291 [2018-01-28 21:07:17,664 INFO L226 Difference]: Without dead ends: 288 [2018-01-28 21:07:17,666 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=611, Invalid=2041, Unknown=0, NotChecked=0, Total=2652 [2018-01-28 21:07:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-28 21:07:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 217. [2018-01-28 21:07:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-28 21:07:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 236 transitions. [2018-01-28 21:07:17,687 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 236 transitions. Word has length 82 [2018-01-28 21:07:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:17,687 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 236 transitions. [2018-01-28 21:07:17,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 21:07:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 236 transitions. [2018-01-28 21:07:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-28 21:07:17,688 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:17,689 INFO L330 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-28 21:07:17,689 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-28 21:07:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash -44753279, now seen corresponding path program 2 times [2018-01-28 21:07:17,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:17,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:17,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:17,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:17,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:17,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:17,844 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-28 21:07:17,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:17,844 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-28 21:07:17,851 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:07:17,868 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:07:17,878 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:07:17,885 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:07:17,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:17,998 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-28 21:07:18,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:18,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-01-28 21:07:18,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 21:07:18,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 21:07:18,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-01-28 21:07:18,021 INFO L87 Difference]: Start difference. First operand 217 states and 236 transitions. Second operand 20 states. [2018-01-28 21:07:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:18,373 INFO L93 Difference]: Finished difference Result 293 states and 318 transitions. [2018-01-28 21:07:18,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 21:07:18,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2018-01-28 21:07:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:18,375 INFO L225 Difference]: With dead ends: 293 [2018-01-28 21:07:18,375 INFO L226 Difference]: Without dead ends: 213 [2018-01-28 21:07:18,375 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-01-28 21:07:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-28 21:07:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 178. [2018-01-28 21:07:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-28 21:07:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-01-28 21:07:18,392 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 87 [2018-01-28 21:07:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:18,393 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-01-28 21:07:18,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 21:07:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-01-28 21:07:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-28 21:07:18,394 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:18,394 INFO L330 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-28 21:07:18,394 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-28 21:07:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1585459244, now seen corresponding path program 2 times [2018-01-28 21:07:18,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:18,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:18,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:18,396 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:07:18,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:18,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:18,475 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-28 21:07:18,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:18,475 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-28 21:07:18,491 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:07:18,509 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:07:18,513 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:07:18,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:18,527 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-28 21:07:18,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:18,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:07:18,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 21:07:18,557 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-28 21:07:18,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:18,564 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-28 21:07:18,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-28 21:07:18,679 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-28 21:07:18,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:18,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-01-28 21:07:18,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:07:18,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:07:18,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:07:18,713 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 11 states. [2018-01-28 21:07:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:19,305 INFO L93 Difference]: Finished difference Result 344 states and 377 transitions. [2018-01-28 21:07:19,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:07:19,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-01-28 21:07:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:19,306 INFO L225 Difference]: With dead ends: 344 [2018-01-28 21:07:19,306 INFO L226 Difference]: Without dead ends: 259 [2018-01-28 21:07:19,307 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:07:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-28 21:07:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 159. [2018-01-28 21:07:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-28 21:07:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-01-28 21:07:19,317 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 90 [2018-01-28 21:07:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:19,317 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-01-28 21:07:19,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:07:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-01-28 21:07:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-28 21:07:19,318 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:19,318 INFO L330 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-28 21:07:19,318 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-28 21:07:19,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1982176244, now seen corresponding path program 1 times [2018-01-28 21:07:19,319 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:19,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:19,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:19,320 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:07:19,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:19,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:19,558 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-28 21:07:19,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:19,559 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-28 21:07:19,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:19,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:19,755 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-28 21:07:19,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:19,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-01-28 21:07:19,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 21:07:19,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 21:07:19,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-01-28 21:07:19,777 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 23 states. [2018-01-28 21:07:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:20,378 INFO L93 Difference]: Finished difference Result 278 states and 302 transitions. [2018-01-28 21:07:20,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:07:20,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-01-28 21:07:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:20,379 INFO L225 Difference]: With dead ends: 278 [2018-01-28 21:07:20,380 INFO L226 Difference]: Without dead ends: 210 [2018-01-28 21:07:20,380 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 21:07:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-28 21:07:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 184. [2018-01-28 21:07:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-28 21:07:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2018-01-28 21:07:20,391 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 94 [2018-01-28 21:07:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:20,392 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2018-01-28 21:07:20,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 21:07:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2018-01-28 21:07:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-28 21:07:20,393 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:20,393 INFO L330 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-28 21:07:20,393 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-28 21:07:20,393 INFO L82 PathProgramCache]: Analyzing trace with hash 338548953, now seen corresponding path program 2 times [2018-01-28 21:07:20,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:20,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:20,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:20,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:07:20,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:20,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:20,534 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-28 21:07:20,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:20,534 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-28 21:07:20,539 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:07:20,552 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:07:20,563 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:07:20,564 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:07:20,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:20,705 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-28 21:07:20,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:07:20,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 21 [2018-01-28 21:07:20,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 21:07:20,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 21:07:20,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-01-28 21:07:20,727 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand 21 states. [2018-01-28 21:07:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:21,333 INFO L93 Difference]: Finished difference Result 363 states and 391 transitions. [2018-01-28 21:07:21,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 21:07:21,430 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-01-28 21:07:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:21,431 INFO L225 Difference]: With dead ends: 363 [2018-01-28 21:07:21,431 INFO L226 Difference]: Without dead ends: 267 [2018-01-28 21:07:21,433 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=1917, Unknown=0, NotChecked=0, Total=2352 [2018-01-28 21:07:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-01-28 21:07:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 240. [2018-01-28 21:07:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-28 21:07:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 256 transitions. [2018-01-28 21:07:21,452 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 256 transitions. Word has length 109 [2018-01-28 21:07:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:21,453 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 256 transitions. [2018-01-28 21:07:21,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 21:07:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 256 transitions. [2018-01-28 21:07:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-28 21:07:21,454 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:07:21,454 INFO L330 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-28 21:07:21,454 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-28 21:07:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1285149348, now seen corresponding path program 3 times [2018-01-28 21:07:21,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:07:21,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:07:21,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:21,456 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:07:21,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:07:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:07:21,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:07:21,755 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-28 21:07:21,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:07:21,756 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-28 21:07:21,760 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:07:21,773 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:07:21,777 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:07:21,778 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:07:21,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:07:21,784 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-28 21:07:21,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:21,789 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-28 21:07:21,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:21,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:07:21,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-28 21:07:21,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:07:21,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:07:21,819 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-28 21:07:21,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:21,825 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-28 21:07:21,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:07:21,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:07:21,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-28 21:07:22,366 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-28 21:07:22,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:07:22,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2018-01-28 21:07:22,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 21:07:22,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 21:07:22,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=520, Unknown=1, NotChecked=0, Total=600 [2018-01-28 21:07:22,387 INFO L87 Difference]: Start difference. First operand 240 states and 256 transitions. Second operand 25 states. [2018-01-28 21:07:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:07:24,321 INFO L93 Difference]: Finished difference Result 290 states and 311 transitions. [2018-01-28 21:07:24,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 21:07:24,321 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2018-01-28 21:07:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:07:24,322 INFO L225 Difference]: With dead ends: 290 [2018-01-28 21:07:24,322 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:07:24,324 INFO L533 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-28 21:07:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:07:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:07:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:07:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:07:24,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2018-01-28 21:07:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:07:24,325 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:07:24,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 21:07:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:07:24,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:07:24,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:07:24,459 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:07:24,558 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 149 DAG size of output 137 [2018-01-28 21:07:24,674 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 126 [2018-01-28 21:07:24,785 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:07:25,148 WARN L146 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 169 DAG size of output 164 [2018-01-28 21:07:26,700 WARN L146 SmtUtils]: Spent 1548ms on a formula simplification. DAG size of input: 141 DAG size of output 107 [2018-01-28 21:07:28,040 WARN L146 SmtUtils]: Spent 1315ms on a formula simplification. DAG size of input: 136 DAG size of output 98 [2018-01-28 21:07:28,943 WARN L146 SmtUtils]: Spent 878ms on a formula simplification. DAG size of input: 115 DAG size of output 86 [2018-01-28 21:07:30,510 WARN L146 SmtUtils]: Spent 1564ms on a formula simplification. DAG size of input: 170 DAG size of output 102 [2018-01-28 21:07:30,513 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,513 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point L549'''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point lisErr16RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point L549''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point lisErr7RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point L549'''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point L549''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point lisErr5RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point lisFINAL(lines 540 555) no Hoare annotation was computed. [2018-01-28 21:07:30,514 INFO L399 ceAbstractionStarter]: For program point lisErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point lisErr18RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L549''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L547''(lines 547 550) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point lisErr20RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L552''''(line 552) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point lisErr12RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L549''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point lisErr4RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-28 21:07:30,515 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-28 21:07:30,516 INFO L399 ceAbstractionStarter]: For program point L549'''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,516 INFO L399 ceAbstractionStarter]: For program point L549''''''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,516 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-28 21:07:30,516 INFO L399 ceAbstractionStarter]: For program point L548'(lines 548 550) no Hoare annotation was computed. [2018-01-28 21:07:30,516 INFO L399 ceAbstractionStarter]: For program point lisErr19RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,516 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-28 21:07:30,516 INFO L399 ceAbstractionStarter]: For program point L549''''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,516 INFO L399 ceAbstractionStarter]: For program point L549''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,516 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point lisEXIT(lines 540 555) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point lisErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L549''''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point lisErr8RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L549'''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-28 21:07:30,517 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,518 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-28 21:07:30,518 INFO L399 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-28 21:07:30,518 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-28 21:07:30,518 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-28 21:07:30,518 INFO L399 ceAbstractionStarter]: For program point lisErr15RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,518 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-28 21:07:30,518 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-28 21:07:30,518 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-28 21:07:30,518 INFO L399 ceAbstractionStarter]: For program point lisErr10RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,519 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-28 21:07:30,519 INFO L399 ceAbstractionStarter]: For program point L551'''(line 551) no Hoare annotation was computed. [2018-01-28 21:07:30,519 INFO L399 ceAbstractionStarter]: For program point lisErr13RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,519 INFO L399 ceAbstractionStarter]: For program point lisErr21RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,519 INFO L399 ceAbstractionStarter]: For program point L549'''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,519 INFO L399 ceAbstractionStarter]: For program point L548'''(lines 548 550) no Hoare annotation was computed. [2018-01-28 21:07:30,519 INFO L399 ceAbstractionStarter]: For program point L551''''(line 551) no Hoare annotation was computed. [2018-01-28 21:07:30,519 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,519 INFO L399 ceAbstractionStarter]: For program point L547''''''(lines 547 550) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point lisErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point L550'''(line 550) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point L551''''''(lines 551 553) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point lisErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point L549'''''''''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point L549'''''''''''''(line 549) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point lisErr11RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,520 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-28 21:07:30,521 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-28 21:07:30,521 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-28 21:07:30,521 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-28 21:07:30,521 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-28 21:07:30,521 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-28 21:07:30,521 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-28 21:07:30,521 INFO L399 ceAbstractionStarter]: For program point lisErr14RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,521 INFO L399 ceAbstractionStarter]: For program point L545''''''(lines 545 546) no Hoare annotation was computed. [2018-01-28 21:07:30,521 INFO L399 ceAbstractionStarter]: For program point lisErr9RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,522 INFO L399 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-28 21:07:30,522 INFO L399 ceAbstractionStarter]: For program point lisErr6RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,522 INFO L399 ceAbstractionStarter]: For program point L545'(lines 545 546) no Hoare annotation was computed. [2018-01-28 21:07:30,522 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-28 21:07:30,522 INFO L399 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-28 21:07:30,522 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-28 21:07:30,522 INFO L399 ceAbstractionStarter]: For program point lisErr17RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,522 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-28 21:07:30,522 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,522 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-28 21:07:30,523 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-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 556 563) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L558(lines 558 560) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 556 563) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 556 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L561''(line 561) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L558''(lines 558 560) no Hoare annotation was computed. [2018-01-28 21:07:30,523 INFO L399 ceAbstractionStarter]: For program point L562'''(line 562) no Hoare annotation was computed. [2018-01-28 21:07:30,524 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-28 21:07:30,524 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 556 563) no Hoare annotation was computed. [2018-01-28 21:07:30,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-28 21:07:30,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-28 21:07:30,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-28 21:07:30,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-28 21:07:30,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,603 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,613 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:07:30 BoogieIcfgContainer [2018-01-28 21:07:30,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:07:30,654 INFO L168 Benchmark]: Toolchain (without parser) took 23129.58 ms. Allocated memory was 308.3 MB in the beginning and 712.5 MB in the end (delta: 404.2 MB). Free memory was 268.3 MB in the beginning and 533.6 MB in the end (delta: -265.3 MB). Peak memory consumption was 351.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:30,655 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:07:30,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.35 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:30,656 INFO L168 Benchmark]: Boogie Preprocessor took 38.59 ms. Allocated memory is still 308.3 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:30,656 INFO L168 Benchmark]: RCFGBuilder took 448.15 ms. Allocated memory is still 308.3 MB. Free memory was 255.3 MB in the beginning and 227.6 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:30,657 INFO L168 Benchmark]: TraceAbstraction took 22396.11 ms. Allocated memory was 308.3 MB in the beginning and 712.5 MB in the end (delta: 404.2 MB). Free memory was 227.6 MB in the beginning and 533.6 MB in the end (delta: -306.0 MB). Peak memory consumption was 310.3 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:30,659 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.24 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.35 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.59 ms. Allocated memory is still 308.3 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 448.15 ms. Allocated memory is still 308.3 MB. Free memory was 255.3 MB in the beginning and 227.6 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22396.11 ms. Allocated memory was 308.3 MB in the beginning and 712.5 MB in the end (delta: 404.2 MB). Free memory was 227.6 MB in the beginning and 533.6 MB in the end (delta: -306.0 MB). Peak memory consumption was 310.3 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-28 21:07:30,672 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-28 21:07:30,672 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-28 21:07:30,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,676 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,677 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,678 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-28 21:07:30,681 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-01-28 21:07:30,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,683 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,684 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,687 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-28 21:07:30,689 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,689 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,689 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,696 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,701 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-28 21:07:30,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,705 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,705 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,705 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,706 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,706 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,706 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,708 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,708 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,708 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,708 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,708 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,708 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-28 21:07:30,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,711 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,711 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,712 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,712 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,712 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,712 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,712 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,712 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,712 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,720 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,720 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[lis_~i~2,QUANTIFIED] [2018-01-28 21:07:30,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:07:30,727 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.2s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 6.1s 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.7s 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.8s HoareSimplificationTime, 10 FomulaSimplificationsInter, 16702 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s 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-28_21-07-30-734.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-28_21-07-30-734.csv Received shutdown request...