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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:40:32,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:40:32,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:40:32,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:40:32,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:40:32,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:40:32,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:40:32,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:40:32,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:40:32,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:40:32,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:40:32,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:40:32,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:40:32,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:40:32,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:40:32,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:40:32,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:40:32,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:40:32,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:40:32,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:40:32,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:40:32,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:40:32,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:40:32,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:40:32,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:40:32,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:40:32,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:40:32,295 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:40:32,295 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:40:32,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:40:32,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:40:32,296 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:40:32,305 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:40:32,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:40:32,306 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:40:32,306 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:40:32,306 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:40:32,306 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:40:32,306 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:40:32,306 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:40:32,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:40:32,307 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:40:32,307 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:40:32,307 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:40:32,307 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:40:32,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:40:32,308 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:40:32,308 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:40:32,308 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:40:32,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:40:32,308 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:40:32,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:40:32,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:40:32,309 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:40:32,309 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:40:32,309 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:40:32,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:40:32,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:40:32,310 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:40:32,310 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:40:32,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:40:32,310 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:40:32,310 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:40:32,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:40:32,310 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:40:32,310 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:40:32,311 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:40:32,311 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:40:32,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:40:32,357 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:40:32,360 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:40:32,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:40:32,361 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:40:32,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:40:32,517 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:40:32,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:40:32,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:40:32,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:40:32,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:40:32,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32, skipping insertion in model container [2018-01-24 16:40:32,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,546 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:40:32,582 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:40:32,698 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:40:32,714 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:40:32,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32 WrapperNode [2018-01-24 16:40:32,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:40:32,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:40:32,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:40:32,724 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:40:32,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (1/1) ... [2018-01-24 16:40:32,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:40:32,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:40:32,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:40:32,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:40:32,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (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-24 16:40:32,805 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:40:32,805 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:40:32,806 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:40:32,806 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:40:32,806 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:40:32,806 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:40:32,806 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:40:32,806 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:40:32,807 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:40:32,807 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:40:32,807 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:40:32,807 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:40:33,008 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:40:33,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:40:33 BoogieIcfgContainer [2018-01-24 16:40:33,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:40:33,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:40:33,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:40:33,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:40:33,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:40:32" (1/3) ... [2018-01-24 16:40:33,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3bdf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:40:33, skipping insertion in model container [2018-01-24 16:40:33,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:32" (2/3) ... [2018-01-24 16:40:33,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3bdf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:40:33, skipping insertion in model container [2018-01-24 16:40:33,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:40:33" (3/3) ... [2018-01-24 16:40:33,016 INFO L105 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:40:33,022 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:40:33,028 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 16:40:33,073 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:40:33,073 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:40:33,073 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:40:33,073 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:40:33,074 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:40:33,074 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:40:33,074 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:40:33,074 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:40:33,075 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:40:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-24 16:40:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:40:33,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:33,103 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:33,104 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1460855103, now seen corresponding path program 1 times [2018-01-24 16:40:33,112 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:33,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:33,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:33,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:33,162 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:33,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:33,297 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-24 16:40:33,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:33,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:40:33,300 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:33,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:40:33,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:40:33,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:40:33,315 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2018-01-24 16:40:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:33,476 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-01-24 16:40:33,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:40:33,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 16:40:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:33,485 INFO L225 Difference]: With dead ends: 69 [2018-01-24 16:40:33,485 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 16:40:33,488 INFO L525 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-24 16:40:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 16:40:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 16:40:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 16:40:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-24 16:40:33,518 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2018-01-24 16:40:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:33,519 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-24 16:40:33,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:40:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-24 16:40:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:40:33,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:33,520 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:33,520 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:33,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174720, now seen corresponding path program 1 times [2018-01-24 16:40:33,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:33,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:33,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:33,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:33,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:33,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:33,588 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-24 16:40:33,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:33,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:40:33,588 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:33,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:40:33,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:40:33,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:40:33,591 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-01-24 16:40:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:33,658 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-01-24 16:40:33,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:40:33,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:40:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:33,660 INFO L225 Difference]: With dead ends: 39 [2018-01-24 16:40:33,660 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 16:40:33,661 INFO L525 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-24 16:40:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 16:40:33,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 16:40:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 16:40:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-24 16:40:33,667 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-01-24 16:40:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:33,668 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-24 16:40:33,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:40:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-24 16:40:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:40:33,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:33,669 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:33,669 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174719, now seen corresponding path program 1 times [2018-01-24 16:40:33,669 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:33,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:33,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:33,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:33,671 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:33,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:33,892 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-24 16:40:33,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:33,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:40:33,893 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:33,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:40:33,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:40:33,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:40:33,894 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-01-24 16:40:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:34,077 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-24 16:40:34,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:40:34,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 16:40:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:34,078 INFO L225 Difference]: With dead ends: 60 [2018-01-24 16:40:34,078 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 16:40:34,078 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:40:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 16:40:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 16:40:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 16:40:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-01-24 16:40:34,084 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2018-01-24 16:40:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:34,084 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-01-24 16:40:34,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:40:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-01-24 16:40:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:40:34,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:34,085 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:34,085 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2068353263, now seen corresponding path program 1 times [2018-01-24 16:40:34,086 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:34,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:34,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:34,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:34,087 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:34,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:34,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:34,147 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:34,148 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-01-24 16:40:34,150 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [13], [19], [23], [28], [33], [35], [37], [39], [86], [87], [88] [2018-01-24 16:40:34,197 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:34,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:34,347 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:34,348 INFO L268 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-24 16:40:34,366 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:34,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:34,366 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:40:34,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:34,376 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:34,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:34,478 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:34,530 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:40:34,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 8 [2018-01-24 16:40:34,530 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:34,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:40:34,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:40:34,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:40:34,531 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-01-24 16:40:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:34,580 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-24 16:40:34,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:40:34,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 16:40:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:34,582 INFO L225 Difference]: With dead ends: 93 [2018-01-24 16:40:34,583 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 16:40:34,583 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:40:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 16:40:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-01-24 16:40:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 16:40:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-24 16:40:34,592 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2018-01-24 16:40:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:34,593 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-24 16:40:34,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:40:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-24 16:40:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:40:34,594 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:34,594 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:34,594 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1639808019, now seen corresponding path program 1 times [2018-01-24 16:40:34,594 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:34,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:34,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:34,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:34,597 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:34,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:34,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:34,785 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:34,785 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-01-24 16:40:34,785 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [13], [19], [23], [28], [33], [35], [37], [39], [86], [87], [88] [2018-01-24 16:40:34,787 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:34,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:34,870 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:34,870 INFO L268 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-24 16:40:34,872 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:34,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:34,872 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:40:34,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:34,881 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:34,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:34,922 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-24 16:40:34,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:34,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:34,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 16:40:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:34,968 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:35,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:35,108 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:40:35,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:35,111 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:35,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:35,146 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-24 16:40:35,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:35,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:35,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 16:40:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:35,196 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:35,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:40:35,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 12 [2018-01-24 16:40:35,274 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:40:35,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:40:35,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:40:35,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:40:35,275 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2018-01-24 16:40:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:35,390 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 16:40:35,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:40:35,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 16:40:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:35,391 INFO L225 Difference]: With dead ends: 50 [2018-01-24 16:40:35,391 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 16:40:35,391 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:40:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 16:40:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-24 16:40:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 16:40:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-24 16:40:35,396 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2018-01-24 16:40:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:35,396 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-24 16:40:35,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:40:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-24 16:40:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:40:35,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:35,397 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:35,397 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1536064265, now seen corresponding path program 1 times [2018-01-24 16:40:35,398 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:35,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:35,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:35,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:35,399 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:35,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:35,518 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-24 16:40:35,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:35,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:40:35,518 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:35,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:40:35,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:40:35,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:40:35,519 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 9 states. [2018-01-24 16:40:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:35,657 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-01-24 16:40:35,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:40:35,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 16:40:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:35,658 INFO L225 Difference]: With dead ends: 66 [2018-01-24 16:40:35,658 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 16:40:35,659 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:40:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 16:40:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-01-24 16:40:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:40:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-24 16:40:35,665 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2018-01-24 16:40:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:35,665 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-24 16:40:35,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:40:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-24 16:40:35,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:40:35,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:35,666 INFO L322 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] [2018-01-24 16:40:35,666 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1312069626, now seen corresponding path program 1 times [2018-01-24 16:40:35,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:35,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:35,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:35,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:35,667 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:35,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 16:40:35,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:35,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:40:35,715 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:35,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:40:35,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:40:35,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:40:35,715 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 4 states. [2018-01-24 16:40:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:35,765 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-24 16:40:35,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:40:35,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-24 16:40:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:35,766 INFO L225 Difference]: With dead ends: 61 [2018-01-24 16:40:35,766 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 16:40:35,767 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:40:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 16:40:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-01-24 16:40:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:40:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-24 16:40:35,774 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 24 [2018-01-24 16:40:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:35,775 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-24 16:40:35,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:40:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-24 16:40:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:40:35,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:35,776 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:35,776 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:35,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2040947294, now seen corresponding path program 1 times [2018-01-24 16:40:35,777 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:35,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:35,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:35,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:35,778 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:35,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:35,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:35,966 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:35,966 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 16:40:35,967 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [13], [19], [23], [26], [28], [33], [35], [39], [43], [47], [52], [56], [58], [60], [63], [77], [86], [87], [88] [2018-01-24 16:40:35,968 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:35,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:36,164 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:36,164 INFO L268 AbstractInterpreter]: Visited 24 different actions 52 times. Merged at 14 different actions 27 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-24 16:40:36,171 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:36,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:36,171 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:40:36,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:36,185 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:36,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 16:40:36,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 16:40:36,331 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:40:36,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2018-01-24 16:40:36,331 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:36,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:40:36,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:40:36,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:40:36,332 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-01-24 16:40:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:36,369 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 16:40:36,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:40:36,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 16:40:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:36,370 INFO L225 Difference]: With dead ends: 91 [2018-01-24 16:40:36,370 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 16:40:36,371 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:40:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 16:40:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-24 16:40:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 16:40:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-24 16:40:36,380 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-01-24 16:40:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:36,380 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-24 16:40:36,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:40:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-24 16:40:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:40:36,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:36,381 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:36,382 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2035165284, now seen corresponding path program 1 times [2018-01-24 16:40:36,382 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:36,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:36,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:36,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:36,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:36,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:36,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:36,617 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:36,617 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 16:40:36,617 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [13], [19], [23], [26], [28], [33], [35], [39], [43], [47], [52], [56], [58], [60], [63], [77], [86], [87], [88] [2018-01-24 16:40:36,619 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:36,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:36,782 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:36,783 INFO L268 AbstractInterpreter]: Visited 24 different actions 52 times. Merged at 14 different actions 27 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-24 16:40:36,787 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:36,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:36,788 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:40:36,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:36,799 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:36,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:36,897 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:36,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:36,975 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:40:36,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:36,982 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:37,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:37,011 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:37,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:40:37,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 7, 7] total 17 [2018-01-24 16:40:37,054 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:40:37,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:40:37,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:40:37,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:40:37,056 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 15 states. [2018-01-24 16:40:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:37,392 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-01-24 16:40:37,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:40:37,393 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-24 16:40:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:37,394 INFO L225 Difference]: With dead ends: 112 [2018-01-24 16:40:37,394 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 16:40:37,394 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-01-24 16:40:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 16:40:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2018-01-24 16:40:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 16:40:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-01-24 16:40:37,404 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2018-01-24 16:40:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:37,404 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-01-24 16:40:37,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:40:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-01-24 16:40:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:40:37,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:37,405 INFO L322 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] [2018-01-24 16:40:37,405 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1450783205, now seen corresponding path program 1 times [2018-01-24 16:40:37,406 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:37,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:37,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:37,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:37,406 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:37,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:37,493 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-24 16:40:37,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:37,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:40:37,494 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:37,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:40:37,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:40:37,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:40:37,495 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2018-01-24 16:40:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:37,527 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 16:40:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:40:37,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-24 16:40:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:37,528 INFO L225 Difference]: With dead ends: 73 [2018-01-24 16:40:37,528 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 16:40:37,529 INFO L525 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-24 16:40:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 16:40:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 16:40:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 16:40:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-24 16:40:37,536 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2018-01-24 16:40:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:37,536 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-24 16:40:37,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:40:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-24 16:40:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:40:37,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:37,537 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:37,538 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 16:40:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash 262979632, now seen corresponding path program 2 times [2018-01-24 16:40:37,538 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:37,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:37,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:37,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:37,539 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:37,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 16:40:37,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:37,651 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:37,652 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:40:37,652 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:40:37,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:37,652 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:40:37,665 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:40:37,665 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:40:37,676 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:37,693 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:37,694 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:40:37,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:37,834 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:37,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:40:37,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:37,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 16:40:37,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:37,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:37,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-01-24 16:40:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:38,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:38,012 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:40:38,015 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:40:38,015 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:40:38,025 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:38,036 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:38,044 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:40:38,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:38,174 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:38,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 16:40:38,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:38,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:40:38,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:38,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:38,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-01-24 16:40:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:38,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:40:38,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 8, 8] total 28 [2018-01-24 16:40:38,226 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:40:38,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:40:38,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:40:38,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2018-01-24 16:40:38,227 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 15 states. [2018-01-24 16:40:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:38,508 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-01-24 16:40:38,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:40:38,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-24 16:40:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:38,509 INFO L225 Difference]: With dead ends: 58 [2018-01-24 16:40:38,509 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:40:38,510 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 16:40:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:40:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:40:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:40:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:40:38,511 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-01-24 16:40:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:38,511 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:40:38,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:40:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:40:38,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:40:38,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:40:38,801 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 60 DAG size of output 38 [2018-01-24 16:40:39,093 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 68 DAG size of output 44 [2018-01-24 16:40:39,319 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 68 DAG size of output 46 [2018-01-24 16:40:39,321 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point mainErr8EnsuresViolation(lines 540 560) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,322 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 553) no Hoare annotation was computed. [2018-01-24 16:40:39,323 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,323 INFO L397 ceAbstractionStarter]: At program point L555'''(lines 555 557) the Hoare annotation is: (let ((.cse9 (* 4 main_~j~2)) (.cse14 (* 4 main_~length~2)) (.cse15 (+ (* 4 main_~i~2) main_~arr~2.offset)) (.cse10 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (<= .cse15 .cse10)) (.cse3 (<= (+ main_~arr~2.offset .cse14) .cse10)) (.cse4 (= .cse14 .cse10)) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| main_~arr~2.base))) (.cse8 (+ main_~arr~2.offset .cse9)) (.cse11 (<= 4 .cse15)) (.cse12 (= 0 |main_#t~malloc1.offset|)) (.cse13 (= .cse14 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 4 .cse8) (<= 0 main_~arr~2.offset) (<= (+ main_~arr~2.offset .cse9 4) .cse10) .cse11 .cse12 .cse13) (and .cse0 .cse1 (= main_~j~2 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 .cse8) .cse11 .cse12 .cse13)))) [2018-01-24 16:40:39,323 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 558) no Hoare annotation was computed. [2018-01-24 16:40:39,323 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-24 16:40:39,323 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 540 560) no Hoare annotation was computed. [2018-01-24 16:40:39,323 INFO L401 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,323 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 540 560) no Hoare annotation was computed. [2018-01-24 16:40:39,323 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 540 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:40:39,323 INFO L401 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,323 INFO L397 ceAbstractionStarter]: At program point L554'''(lines 554 558) the Hoare annotation is: (let ((.cse12 (* 4 main_~length~2)) (.cse13 (+ (* 4 main_~i~2) main_~arr~2.offset)) (.cse14 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (<= .cse13 .cse14)) (.cse3 (<= (+ main_~arr~2.offset .cse12) .cse14)) (.cse4 (= .cse12 .cse14)) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| main_~arr~2.base))) (.cse8 (+ main_~arr~2.offset (* 4 main_~j~2))) (.cse9 (<= 4 .cse13)) (.cse10 (= 0 |main_#t~malloc1.offset|)) (.cse11 (= .cse12 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 (= main_~j~2 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 .cse8) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 4 .cse8) (<= 0 main_~arr~2.offset) .cse9 .cse10 .cse11)))) [2018-01-24 16:40:39,323 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L397 ceAbstractionStarter]: At program point L547''(lines 547 553) the Hoare annotation is: (let ((.cse11 (* 4 main_~length~2)) (.cse4 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= main_~arr~2.offset 0)) (.cse2 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse5 (= .cse11 .cse4)) (.cse6 (not (= 0 |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse8 (= 1 (select |#valid| main_~arr~2.base))) (.cse9 (= 0 |main_#t~malloc1.offset|)) (.cse10 (= .cse11 (select |#length| |main_#t~malloc1.base|)))) (or (let ((.cse3 (+ (* 4 main_~i~2) main_~arr~2.offset))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 (<= 4 .cse3) .cse9 .cse10)) (and .cse0 .cse1 .cse2 (<= 1 main_~length~2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= main_~i~2 0))))) [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point L547'''(lines 547 553) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 16:40:39,324 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-24 16:40:39,325 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-24 16:40:39,325 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-01-24 16:40:39,325 INFO L401 ceAbstractionStarter]: For program point L554''''(lines 554 558) no Hoare annotation was computed. [2018-01-24 16:40:39,325 INFO L401 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-24 16:40:39,325 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 16:40:39,325 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 16:40:39,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,341 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,341 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,341 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,346 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,356 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,357 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,358 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:40:39 BoogieIcfgContainer [2018-01-24 16:40:39,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:40:39,366 INFO L168 Benchmark]: Toolchain (without parser) took 6848.08 ms. Allocated memory was 294.6 MB in the beginning and 537.9 MB in the end (delta: 243.3 MB). Free memory was 254.6 MB in the beginning and 452.8 MB in the end (delta: -198.3 MB). Peak memory consumption was 199.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:40:39,366 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 294.6 MB. Free memory is still 260.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:40:39,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.84 ms. Allocated memory is still 294.6 MB. Free memory was 253.6 MB in the beginning and 243.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:40:39,367 INFO L168 Benchmark]: Boogie Preprocessor took 36.31 ms. Allocated memory is still 294.6 MB. Free memory was 243.5 MB in the beginning and 241.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:40:39,367 INFO L168 Benchmark]: RCFGBuilder took 249.11 ms. Allocated memory is still 294.6 MB. Free memory was 241.5 MB in the beginning and 225.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:40:39,368 INFO L168 Benchmark]: TraceAbstraction took 6355.24 ms. Allocated memory was 294.6 MB in the beginning and 537.9 MB in the end (delta: 243.3 MB). Free memory was 224.5 MB in the beginning and 452.8 MB in the end (delta: -228.4 MB). Peak memory consumption was 169.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:40:39,369 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.13 ms. Allocated memory is still 294.6 MB. Free memory is still 260.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.84 ms. Allocated memory is still 294.6 MB. Free memory was 253.6 MB in the beginning and 243.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.31 ms. Allocated memory is still 294.6 MB. Free memory was 243.5 MB in the beginning and 241.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 249.11 ms. Allocated memory is still 294.6 MB. Free memory was 241.5 MB in the beginning and 225.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6355.24 ms. Allocated memory was 294.6 MB in the beginning and 537.9 MB in the end (delta: 243.3 MB). Free memory was 224.5 MB in the beginning and 452.8 MB in the end (delta: -228.4 MB). Peak memory consumption was 169.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 121 LocStat_NO_SUPPORTING_DISEQUALITIES : 16 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 20 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 32 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.875914 RENAME_VARIABLES(MILLISECONDS) : 0.719960 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.814423 PROJECTAWAY(MILLISECONDS) : 0.287879 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001042 DISJOIN(MILLISECONDS) : 1.188817 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.778676 ADD_EQUALITY(MILLISECONDS) : 0.118232 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012607 #CONJOIN_DISJUNCTIVE : 36 #RENAME_VARIABLES : 58 #UNFREEZE : 0 #CONJOIN : 62 #PROJECTAWAY : 51 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 55 #ADD_EQUALITY : 32 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 130 LocStat_NO_SUPPORTING_DISEQUALITIES : 16 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 20 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 33 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.838906 RENAME_VARIABLES(MILLISECONDS) : 0.600372 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.785723 PROJECTAWAY(MILLISECONDS) : 0.370606 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001107 DISJOIN(MILLISECONDS) : 0.595776 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.647888 ADD_EQUALITY(MILLISECONDS) : 0.047985 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010409 #CONJOIN_DISJUNCTIVE : 36 #RENAME_VARIABLES : 58 #UNFREEZE : 0 #CONJOIN : 62 #PROJECTAWAY : 51 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 55 #ADD_EQUALITY : 33 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 206 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.491425 RENAME_VARIABLES(MILLISECONDS) : 0.362818 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.443147 PROJECTAWAY(MILLISECONDS) : 0.237598 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001304 DISJOIN(MILLISECONDS) : 0.368447 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.398538 ADD_EQUALITY(MILLISECONDS) : 0.036054 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009635 #CONJOIN_DISJUNCTIVE : 90 #RENAME_VARIABLES : 169 #UNFREEZE : 0 #CONJOIN : 123 #PROJECTAWAY : 117 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 161 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 222 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 39 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.519062 RENAME_VARIABLES(MILLISECONDS) : 0.374357 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.478769 PROJECTAWAY(MILLISECONDS) : 0.247235 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001197 DISJOIN(MILLISECONDS) : 0.399599 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.404833 ADD_EQUALITY(MILLISECONDS) : 0.023806 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010913 #CONJOIN_DISJUNCTIVE : 90 #RENAME_VARIABLES : 169 #UNFREEZE : 0 #CONJOIN : 123 #PROJECTAWAY : 117 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 161 #ADD_EQUALITY : 39 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * 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 * 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: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-24 16:40:39,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 1 <= length) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) && i == 0) - InvariantResult [Line: 554]: Loop Invariant [2018-01-24 16:40:39,385 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,385 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,385 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,386 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 <= arr + 4 * j) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= arr + 4 * j) && 0 <= arr) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - InvariantResult [Line: 555]: Loop Invariant [2018-01-24 16:40:39,392 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,393 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,393 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,393 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,393 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,394 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,394 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,394 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,394 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,396 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,397 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,397 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,397 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,397 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,398 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,398 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,398 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:40:39,398 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= arr + 4 * j) && 0 <= arr) && arr + 4 * j + 4 <= unknown-#length-unknown[arr]) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 <= arr + 4 * j) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 9 error locations. SAFE Result, 6.2s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 310 SDtfs, 1119 SDslu, 622 SDs, 0 SdLazy, 600 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 368 SyntacticMatches, 20 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 21 NumberOfFragments, 441 HoareAnnotationTreeSize, 7 FomulaSimplifications, 648 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 935 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 631 ConstructedInterpolants, 56 QuantifiedInterpolants, 120997 SizeOfPredicates, 30 NumberOfNonLiveVariables, 642 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 83/153 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-40-39-404.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-40-39-404.csv Received shutdown request...