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/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:35:25,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:35:25,576 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:35:25,591 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:35:25,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:35:25,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:35:25,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:35:25,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:35:25,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:35:25,598 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:35:25,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:35:25,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:35:25,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:35:25,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:35:25,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:35:25,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:35:25,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:35:25,608 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:35:25,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:35:25,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:35:25,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:35:25,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:35:25,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:35:25,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:35:25,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:35:25,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:35:25,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:35:25,618 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:35:25,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:35:25,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:35:25,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:35:25,619 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:35:25,627 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:35:25,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:35:25,628 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:35:25,628 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:35:25,629 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:35:25,629 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:35:25,629 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:35:25,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:35:25,630 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:35:25,630 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:35:25,630 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:35:25,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:35:25,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:35:25,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:35:25,630 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:35:25,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:35:25,631 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:35:25,631 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:35:25,631 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:35:25,631 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:35:25,631 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:35:25,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:35:25,632 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:35:25,632 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:35:25,632 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:35:25,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:35:25,632 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:35:25,633 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:35:25,634 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:35:25,634 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:35:25,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:35:25,676 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:35:25,680 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:35:25,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:35:25,681 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:35:25,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-01-20 23:35:25,846 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:35:25,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:35:25,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:35:25,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:35:25,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:35:25,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:35:25" (1/1) ... [2018-01-20 23:35:25,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef8971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:25, skipping insertion in model container [2018-01-20 23:35:25,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:35:25" (1/1) ... [2018-01-20 23:35:25,871 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:35:25,908 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:35:26,026 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:35:26,047 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:35:26,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26 WrapperNode [2018-01-20 23:35:26,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:35:26,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:35:26,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:35:26,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:35:26,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (1/1) ... [2018-01-20 23:35:26,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (1/1) ... [2018-01-20 23:35:26,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (1/1) ... [2018-01-20 23:35:26,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (1/1) ... [2018-01-20 23:35:26,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (1/1) ... [2018-01-20 23:35:26,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (1/1) ... [2018-01-20 23:35:26,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (1/1) ... [2018-01-20 23:35:26,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:35:26,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:35:26,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:35:26,092 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:35:26,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (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-20 23:35:26,144 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:35:26,144 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:35:26,144 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:35:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:35:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:35:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:35:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:35:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:35:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:35:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:35:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:35:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:35:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:35:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:35:26,369 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:35:26,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:35:26 BoogieIcfgContainer [2018-01-20 23:35:26,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:35:26,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:35:26,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:35:26,373 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:35:26,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:35:25" (1/3) ... [2018-01-20 23:35:26,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9cdf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:35:26, skipping insertion in model container [2018-01-20 23:35:26,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:35:26" (2/3) ... [2018-01-20 23:35:26,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9cdf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:35:26, skipping insertion in model container [2018-01-20 23:35:26,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:35:26" (3/3) ... [2018-01-20 23:35:26,378 INFO L105 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-01-20 23:35:26,387 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:35:26,393 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 23:35:26,428 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:35:26,428 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:35:26,429 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:35:26,429 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:35:26,429 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:35:26,429 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:35:26,429 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:35:26,429 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:35:26,430 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:35:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-20 23:35:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:35:26,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:35:26,453 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:35:26,453 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:35:26,457 INFO L82 PathProgramCache]: Analyzing trace with hash 98024, now seen corresponding path program 1 times [2018-01-20 23:35:26,458 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:35:26,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:26,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:35:26,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:26,499 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:35:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:35:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:35:26,554 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:35:26,560 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:35:26,566 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:35:26,566 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:35:26,567 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:35:26,567 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:35:26,567 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:35:26,567 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:35:26,567 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:35:26,567 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:35:26,567 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:35:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-20 23:35:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 23:35:26,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:35:26,571 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:35:26,571 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:35:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1566967016, now seen corresponding path program 1 times [2018-01-20 23:35:26,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:35:26,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:26,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:35:26,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:26,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:35:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:35:26,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:35:26,644 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-20 23:35:26,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:35:26,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:35:26,646 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:35:26,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:35:26,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:35:26,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:35:26,660 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-20 23:35:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:35:26,767 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-20 23:35:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:35:26,768 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 23:35:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:35:26,778 INFO L225 Difference]: With dead ends: 60 [2018-01-20 23:35:26,779 INFO L226 Difference]: Without dead ends: 40 [2018-01-20 23:35:26,781 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:35:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-20 23:35:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-20 23:35:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-20 23:35:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-20 23:35:26,809 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2018-01-20 23:35:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:35:26,810 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-20 23:35:26,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:35:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-20 23:35:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 23:35:26,811 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:35:26,811 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:35:26,811 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:35:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2022925235, now seen corresponding path program 1 times [2018-01-20 23:35:26,812 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:35:26,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:26,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:35:26,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:26,813 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:35:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:35:26,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:35:26,907 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-20 23:35:26,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:35:26,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:35:26,908 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:35:26,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:35:26,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:35:26,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:35:26,910 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-20 23:35:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:35:27,071 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-20 23:35:27,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:35:27,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-20 23:35:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:35:27,074 INFO L225 Difference]: With dead ends: 73 [2018-01-20 23:35:27,074 INFO L226 Difference]: Without dead ends: 68 [2018-01-20 23:35:27,075 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-20 23:35:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-20 23:35:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2018-01-20 23:35:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-20 23:35:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-20 23:35:27,082 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2018-01-20 23:35:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:35:27,082 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-20 23:35:27,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:35:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-20 23:35:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 23:35:27,083 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:35:27,084 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, 1, 1, 1, 1] [2018-01-20 23:35:27,084 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:35:27,084 INFO L82 PathProgramCache]: Analyzing trace with hash 745482112, now seen corresponding path program 1 times [2018-01-20 23:35:27,084 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:35:27,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:27,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:35:27,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:27,086 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:35:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:35:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:35:27,132 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:35:27,137 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:35:27,142 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:35:27,142 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:35:27,154 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:35:27,154 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:35:27,154 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:35:27,154 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:35:27,154 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:35:27,155 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:35:27,155 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:35:27,155 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:35:27,155 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:35:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-20 23:35:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 23:35:27,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:35:27,157 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:35:27,157 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:35:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1567082781, now seen corresponding path program 1 times [2018-01-20 23:35:27,157 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:35:27,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:27,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:35:27,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:27,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:35:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:35:27,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:35:27,180 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-20 23:35:27,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:35:27,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:35:27,181 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:35:27,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:35:27,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:35:27,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:35:27,182 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-20 23:35:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:35:27,186 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-20 23:35:27,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:35:27,186 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-20 23:35:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:35:27,187 INFO L225 Difference]: With dead ends: 60 [2018-01-20 23:35:27,188 INFO L226 Difference]: Without dead ends: 38 [2018-01-20 23:35:27,188 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:35:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-20 23:35:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-20 23:35:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-20 23:35:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-20 23:35:27,192 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 16 [2018-01-20 23:35:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:35:27,192 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-20 23:35:27,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:35:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-20 23:35:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 23:35:27,193 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:35:27,193 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:35:27,193 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:35:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1749589112, now seen corresponding path program 1 times [2018-01-20 23:35:27,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:35:27,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:27,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:35:27,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:27,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:35:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:35:27,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:35:27,260 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-20 23:35:27,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:35:27,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:35:27,261 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:35:27,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:35:27,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:35:27,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:35:27,262 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-20 23:35:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:35:27,383 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-20 23:35:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:35:27,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-20 23:35:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:35:27,425 INFO L225 Difference]: With dead ends: 69 [2018-01-20 23:35:27,425 INFO L226 Difference]: Without dead ends: 66 [2018-01-20 23:35:27,426 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-20 23:35:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-20 23:35:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-01-20 23:35:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 23:35:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-20 23:35:27,432 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-20 23:35:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:35:27,432 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-20 23:35:27,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:35:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-20 23:35:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 23:35:27,433 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:35:27,433 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, 1, 1] [2018-01-20 23:35:27,433 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:35:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1944907653, now seen corresponding path program 1 times [2018-01-20 23:35:27,434 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:35:27,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:27,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:35:27,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:35:27,435 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:35:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:35:27,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:35:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:35:27,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:35:27,672 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:35:27,674 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-20 23:35:27,676 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [17], [19], [22], [45], [49], [51], [52], [53], [54], [62], [64], [68], [70], [71], [72], [73] [2018-01-20 23:35:27,731 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:35:27,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:36:13,027 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:36:13,028 INFO L268 AbstractInterpreter]: Visited 25 different actions 58 times. Merged at 10 different actions 31 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-20 23:36:13,046 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:36:13,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:36:13,046 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-20 23:36:13,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:36:13,052 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:36:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:36:13,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:36:13,199 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~4.base 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)))) is different from true [2018-01-20 23:36:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-20 23:36:13,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:36:13,488 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_3| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_3|))) (= 0 |v_main_#t~malloc0.base_3|) (= (store |c_#valid| |v_main_#t~malloc0.base_3| 0) |c_old(#valid)|))) is different from false [2018-01-20 23:36:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:13,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:36:13,521 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-20 23:36:13,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:36:13,527 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:36:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:36:13,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:36:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:13,703 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:36:13,728 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_4| Int)) (or (= (store |c_#valid| |v_main_#t~malloc0.base_4| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc0.base_4|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_4|))))) is different from false [2018-01-20 23:36:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:13,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:36:13,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 8, 6] total 23 [2018-01-20 23:36:13,753 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:36:13,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 23:36:13,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 23:36:13,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=348, Unknown=7, NotChecked=120, Total=552 [2018-01-20 23:36:13,754 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-01-20 23:36:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:36:14,096 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-20 23:36:14,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 23:36:14,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-20 23:36:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:36:14,098 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:36:14,098 INFO L226 Difference]: Without dead ends: 60 [2018-01-20 23:36:14,098 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=532, Unknown=7, NotChecked=150, Total=812 [2018-01-20 23:36:14,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-20 23:36:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-01-20 23:36:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 23:36:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-20 23:36:14,104 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 26 [2018-01-20 23:36:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:36:14,104 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-20 23:36:14,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 23:36:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-20 23:36:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 23:36:14,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:36:14,106 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, 1, 1, 1, 1, 1] [2018-01-20 23:36:14,106 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 23:36:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash 66158503, now seen corresponding path program 1 times [2018-01-20 23:36:14,106 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:36:14,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:36:14,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:36:14,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:36:14,107 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:36:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:36:14,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:36:14,279 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-20 23:36:14,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:36:14,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 23:36:14,280 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:36:14,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 23:36:14,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 23:36:14,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-20 23:36:14,280 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 7 states. [2018-01-20 23:36:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:36:14,417 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-20 23:36:14,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 23:36:14,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-20 23:36:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:36:14,418 INFO L225 Difference]: With dead ends: 71 [2018-01-20 23:36:14,418 INFO L226 Difference]: Without dead ends: 58 [2018-01-20 23:36:14,419 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-20 23:36:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-20 23:36:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-20 23:36:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 23:36:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-20 23:36:14,422 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2018-01-20 23:36:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:36:14,423 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-20 23:36:14,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 23:36:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-20 23:36:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 23:36:14,424 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:36:14,424 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-20 23:36:14,424 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 23:36:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash 304338011, now seen corresponding path program 1 times [2018-01-20 23:36:14,424 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:36:14,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:36:14,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:36:14,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:36:14,425 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:36:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:36:14,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:36:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:14,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:36:14,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:36:14,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:36:14,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:36:14,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:36:14,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:36:14,490 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-20 23:36:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:36:14,569 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-01-20 23:36:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:36:14,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-20 23:36:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:36:14,570 INFO L225 Difference]: With dead ends: 91 [2018-01-20 23:36:14,571 INFO L226 Difference]: Without dead ends: 88 [2018-01-20 23:36:14,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 23:36:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-20 23:36:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-01-20 23:36:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 23:36:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-20 23:36:14,575 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2018-01-20 23:36:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:36:14,575 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-20 23:36:14,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:36:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-20 23:36:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 23:36:14,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:36:14,576 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:36:14,576 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 23:36:14,576 INFO L82 PathProgramCache]: Analyzing trace with hash 264537048, now seen corresponding path program 2 times [2018-01-20 23:36:14,576 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:36:14,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:36:14,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:36:14,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:36:14,578 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:36:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:36:14,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:36:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:14,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:36:14,696 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:36:14,696 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-20 23:36:14,696 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-20 23:36:14,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:36:14,697 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 23:36:14,709 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 23:36:14,709 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-20 23:36:14,723 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:36:14,734 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:36:14,736 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 23:36:14,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:36:14,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 23:36:14,793 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-20 23:36:14,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-20 23:36:14,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 23:36:14,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:36:14,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 23:36:14,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-20 23:36:14,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-20 23:36:14,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:36:14,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:36:14,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:36:14,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-20 23:36:14,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-20 23:36:14,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 21 [2018-01-20 23:36:14,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-20 23:36:14,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:14,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-01-20 23:36:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:14,969 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:36:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:15,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:36:15,061 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-20 23:36:15,065 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 23:36:15,066 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-20 23:36:15,079 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:36:15,094 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:36:15,109 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 23:36:15,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:36:15,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 23:36:15,121 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-20 23:36:15,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-20 23:36:15,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 23:36:15,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:36:15,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 23:36:15,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-20 23:36:15,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-20 23:36:15,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:36:15,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:36:15,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:36:15,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-20 23:36:15,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-20 23:36:15,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 21 [2018-01-20 23:36:15,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-20 23:36:15,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:36:15,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-01-20 23:36:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:15,200 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:36:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:15,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:36:15,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 7, 11, 7] total 18 [2018-01-20 23:36:15,242 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:36:15,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-20 23:36:15,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-20 23:36:15,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-01-20 23:36:15,243 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 15 states. [2018-01-20 23:36:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:36:15,505 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-20 23:36:15,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 23:36:15,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-20 23:36:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:36:15,506 INFO L225 Difference]: With dead ends: 68 [2018-01-20 23:36:15,506 INFO L226 Difference]: Without dead ends: 46 [2018-01-20 23:36:15,506 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-01-20 23:36:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-20 23:36:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-20 23:36:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 23:36:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-20 23:36:15,510 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 33 [2018-01-20 23:36:15,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:36:15,511 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-20 23:36:15,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-20 23:36:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-20 23:36:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 23:36:15,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:36:15,512 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:36:15,512 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 23:36:15,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1962892734, now seen corresponding path program 1 times [2018-01-20 23:36:15,513 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:36:15,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:36:15,514 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 23:36:15,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:36:15,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:36:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:36:15,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:36:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:36:15,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:36:15,739 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:36:15,739 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-20 23:36:15,739 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [17], [19], [22], [24], [25], [26], [27], [28], [29], [36], [37], [39], [45], [49], [51], [52], [53], [54], [62], [64], [68], [70], [71], [72], [73] [2018-01-20 23:36:15,741 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:36:15,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-20 23:36:24,495 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-20 23:36:24,496 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-20 23:36:24,496 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-20 23:36:24,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:36:24,496 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-20 23:36:24,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:36:24,501 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:36:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:36:24,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:36:24,518 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-20 23:36:24,518 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 23:36:24,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:36:24 BoogieIcfgContainer [2018-01-20 23:36:24,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:36:24,521 INFO L168 Benchmark]: Toolchain (without parser) took 58674.41 ms. Allocated memory was 292.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 252.5 MB in the beginning and 806.9 MB in the end (delta: -554.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-20 23:36:24,522 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 292.6 MB. Free memory is still 258.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:36:24,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.38 ms. Allocated memory is still 292.6 MB. Free memory was 251.5 MB in the beginning and 241.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:36:24,522 INFO L168 Benchmark]: Boogie Preprocessor took 35.95 ms. Allocated memory is still 292.6 MB. Free memory was 241.4 MB in the beginning and 239.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:36:24,522 INFO L168 Benchmark]: RCFGBuilder took 277.89 ms. Allocated memory is still 292.6 MB. Free memory was 239.4 MB in the beginning and 221.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:36:24,523 INFO L168 Benchmark]: TraceAbstraction took 58149.80 ms. Allocated memory was 292.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 221.5 MB in the beginning and 806.9 MB in the end (delta: -585.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-20 23:36:24,524 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.14 ms. Allocated memory is still 292.6 MB. Free memory is still 258.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.38 ms. Allocated memory is still 292.6 MB. Free memory was 251.5 MB in the beginning and 241.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.95 ms. Allocated memory is still 292.6 MB. Free memory was 241.4 MB in the beginning and 239.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 277.89 ms. Allocated memory is still 292.6 MB. Free memory was 239.4 MB in the beginning and 221.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58149.80 ms. Allocated memory was 292.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 221.5 MB in the beginning and 806.9 MB in the end (delta: -585.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 22 LocStat_MAX_SIZEOF_WEQEDGELABEL : 7 LocStat_NO_SUPPORTING_EQUALITIES : 276 LocStat_NO_SUPPORTING_DISEQUALITIES : 58 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 42.608822 RENAME_VARIABLES(MILLISECONDS) : 20.978570 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 42.536267 PROJECTAWAY(MILLISECONDS) : 0.165487 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.085798 DISJOIN(MILLISECONDS) : 15.297538 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 21.045458 ADD_EQUALITY(MILLISECONDS) : 0.026057 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015727 #CONJOIN_DISJUNCTIVE : 111 #RENAME_VARIABLES : 219 #UNFREEZE : 0 #CONJOIN : 193 #PROJECTAWAY : 131 #ADD_WEAK_EQUALITY : 16 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 189 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L633] Node* list = ((void *)0); [L634] Node* y = ((void *)0); VAL [list={0:0}, y={0:0}] [L635] EXPR, FCALL malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={0:0}] [L635] y = malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L636] FCALL y->next = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L637] FCALL y->prev = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L638] FCALL y->pData = &y->data VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L639] list = y VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L640] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND TRUE ((void *)0) != list [L657] y = list VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] EXPR, FCALL list->next VAL [list={15:0}, list->next={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] list = list->next [L659] EXPR, FCALL y->pData VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}, y->pData={15:12}] [L659] COND FALSE !(&y->data != y->pData) [L663] FCALL free(y) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L655] COND FALSE !(((void *)0) != list) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L665] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 96 SDslu, 58 SDs, 0 SdLazy, 44 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. TIMEOUT Result, 57.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 220 SDtfs, 445 SDslu, 551 SDs, 0 SdLazy, 484 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 211 SyntacticMatches, 13 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 54.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 375 ConstructedInterpolants, 12 QuantifiedInterpolants, 76427 SizeOfPredicates, 34 NumberOfNonLiveVariables, 446 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 30/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-36-24-534.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-20_23-36-24-534.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-20_23-36-24-534.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-36-24-534.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-36-24-534.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-36-24-534.csv Completed graceful shutdown