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_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:03:07,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:03:07,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:03:07,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:03:07,273 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:03:07,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:03:07,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:03:07,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:03:07,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:03:07,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:03:07,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:03:07,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:03:07,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:03:07,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:03:07,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:03:07,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:03:07,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:03:07,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:03:07,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:03:07,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:03:07,292 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:03:07,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:03:07,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:03:07,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:03:07,294 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:03:07,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:03:07,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:03:07,297 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:03:07,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:03:07,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:03:07,297 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:03:07,298 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_imprecise.epf [2018-01-21 01:03:07,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:03:07,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:03:07,309 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:03:07,309 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:03:07,309 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:03:07,309 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:03:07,309 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:03:07,310 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:03:07,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:03:07,310 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:03:07,311 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:03:07,311 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:03:07,311 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:03:07,311 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:03:07,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:03:07,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:03:07,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:03:07,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:03:07,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:03:07,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:03:07,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:03:07,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:03:07,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:03:07,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:03:07,313 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:03:07,314 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:03:07,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:03:07,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:03:07,314 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:03:07,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:03:07,315 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:03:07,315 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:03:07,315 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:03:07,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:03:07,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:03:07,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:03:07,316 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:03:07,316 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:03:07,317 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:03:07,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:03:07,364 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:03:07,368 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:03:07,370 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:03:07,370 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:03:07,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:03:07,538 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:03:07,542 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:03:07,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:03:07,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:03:07,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:03:07,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c517b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07, skipping insertion in model container [2018-01-21 01:03:07,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,566 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:03:07,605 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:03:07,730 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:03:07,755 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:03:07,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07 WrapperNode [2018-01-21 01:03:07,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:03:07,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:03:07,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:03:07,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:03:07,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (1/1) ... [2018-01-21 01:03:07,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:03:07,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:03:07,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:03:07,812 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:03:07,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:03:07,864 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:03:07,864 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:03:07,864 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:03:07,864 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:03:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:03:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:03:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:03:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:03:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:03:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:03:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:03:07,865 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:03:07,866 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:03:07,866 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:03:07,866 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:03:07,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:03:07,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:03:08,227 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:03:08,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:03:08 BoogieIcfgContainer [2018-01-21 01:03:08,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:03:08,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:03:08,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:03:08,232 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:03:08,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:03:07" (1/3) ... [2018-01-21 01:03:08,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f388128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:03:08, skipping insertion in model container [2018-01-21 01:03:08,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:07" (2/3) ... [2018-01-21 01:03:08,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f388128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:03:08, skipping insertion in model container [2018-01-21 01:03:08,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:03:08" (3/3) ... [2018-01-21 01:03:08,236 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:03:08,244 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:03:08,252 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:03:08,301 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:03:08,301 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:03:08,302 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:03:08,302 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:03:08,302 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:03:08,302 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:03:08,302 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:03:08,302 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:03:08,303 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:03:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-21 01:03:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:03:08,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:08,332 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:03:08,333 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:03:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash 235120, now seen corresponding path program 1 times [2018-01-21 01:03:08,341 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:08,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:08,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:08,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:08,402 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:03:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:03:08,467 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:03:08,474 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:03:08,482 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:03:08,483 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:03:08,483 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:03:08,483 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:03:08,483 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:03:08,483 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:03:08,483 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:03:08,483 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:03:08,484 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:03:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-21 01:03:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 01:03:08,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:08,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:03:08,491 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1114673319, now seen corresponding path program 1 times [2018-01-21 01:03:08,491 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:08,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:08,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:08,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:08,493 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:08,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:08,666 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-21 01:03:08,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:08,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:03:08,669 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:08,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:03:08,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:03:08,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:03:08,690 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 2 states. [2018-01-21 01:03:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:08,712 INFO L93 Difference]: Finished difference Result 160 states and 202 transitions. [2018-01-21 01:03:08,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:03:08,713 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-01-21 01:03:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:08,726 INFO L225 Difference]: With dead ends: 160 [2018-01-21 01:03:08,726 INFO L226 Difference]: Without dead ends: 89 [2018-01-21 01:03:08,729 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-21 01:03:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-21 01:03:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-21 01:03:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 01:03:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-01-21 01:03:08,766 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 31 [2018-01-21 01:03:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:08,766 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-01-21 01:03:08,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:03:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-01-21 01:03:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 01:03:08,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:08,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:03:08,768 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash 584524918, now seen corresponding path program 1 times [2018-01-21 01:03:08,768 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:08,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:08,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:08,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:08,769 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:08,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:09,174 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-21 01:03:09,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:09,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 01:03:09,175 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:09,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 01:03:09,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 01:03:09,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:03:09,178 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 7 states. [2018-01-21 01:03:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:09,437 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2018-01-21 01:03:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 01:03:09,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-01-21 01:03:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:09,443 INFO L225 Difference]: With dead ends: 173 [2018-01-21 01:03:09,443 INFO L226 Difference]: Without dead ends: 133 [2018-01-21 01:03:09,444 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-21 01:03:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-21 01:03:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2018-01-21 01:03:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-21 01:03:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-01-21 01:03:09,455 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 42 [2018-01-21 01:03:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:09,456 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-01-21 01:03:09,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 01:03:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-01-21 01:03:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 01:03:09,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:09,457 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, 1, 1, 1, 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-21 01:03:09,458 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash 224754963, now seen corresponding path program 1 times [2018-01-21 01:03:09,458 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:09,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:09,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:09,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:09,459 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:09,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:09,599 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-21 01:03:09,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:09,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 01:03:09,600 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:09,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 01:03:09,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 01:03:09,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 01:03:09,601 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 6 states. [2018-01-21 01:03:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:09,803 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2018-01-21 01:03:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 01:03:09,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-01-21 01:03:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:09,807 INFO L225 Difference]: With dead ends: 166 [2018-01-21 01:03:09,808 INFO L226 Difference]: Without dead ends: 114 [2018-01-21 01:03:09,808 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-21 01:03:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-21 01:03:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-01-21 01:03:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-21 01:03:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-01-21 01:03:09,821 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 48 [2018-01-21 01:03:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:09,821 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-01-21 01:03:09,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 01:03:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-01-21 01:03:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 01:03:09,823 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:09,824 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, 1, 1, 1, 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-21 01:03:09,824 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash 247387217, now seen corresponding path program 1 times [2018-01-21 01:03:09,824 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:09,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:09,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:09,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:09,825 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:09,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:09,905 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-21 01:03:09,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:09,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:03:09,906 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:09,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:03:09,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:03:09,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:03:09,908 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 5 states. [2018-01-21 01:03:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:10,067 INFO L93 Difference]: Finished difference Result 189 states and 209 transitions. [2018-01-21 01:03:10,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:03:10,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-01-21 01:03:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:10,070 INFO L225 Difference]: With dead ends: 189 [2018-01-21 01:03:10,070 INFO L226 Difference]: Without dead ends: 160 [2018-01-21 01:03:10,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:03:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-21 01:03:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 114. [2018-01-21 01:03:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-21 01:03:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-01-21 01:03:10,084 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 48 [2018-01-21 01:03:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:10,084 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2018-01-21 01:03:10,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:03:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2018-01-21 01:03:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-21 01:03:10,087 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:10,087 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, 1, 1, 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-21 01:03:10,087 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash -24407250, now seen corresponding path program 1 times [2018-01-21 01:03:10,088 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:10,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:10,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:10,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:10,089 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:10,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:10,185 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-21 01:03:10,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:03:10,186 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:03:10,187 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-21 01:03:10,190 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [9], [11], [14], [29], [33], [35], [36], [41], [45], [73], [78], [82], [88], [89], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [108], [112], [116], [118], [119], [120], [121], [122], [123], [127], [131], [135], [180], [184], [188], [197], [198], [200], [201], [206], [207], [208], [209], [210] [2018-01-21 01:03:10,256 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:03:10,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:03:10,638 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:03:10,639 INFO L268 AbstractInterpreter]: Visited 54 different actions 73 times. Merged at 10 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2018-01-21 01:03:10,646 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:03:10,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:03:10,646 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-21 01:03:10,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:10,667 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:03:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:10,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:03:10,796 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-21 01:03:10,796 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:03:10,864 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-21 01:03:10,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:03:10,887 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-21 01:03:10,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:10,897 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:03:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:10,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:03:11,043 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-21 01:03:11,043 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:03:11,084 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-21 01:03:11,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:03:11,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 6 [2018-01-21 01:03:11,090 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:03:11,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 01:03:11,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 01:03:11,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 01:03:11,091 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 6 states. [2018-01-21 01:03:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:11,414 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2018-01-21 01:03:11,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 01:03:11,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-01-21 01:03:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:11,419 INFO L225 Difference]: With dead ends: 232 [2018-01-21 01:03:11,419 INFO L226 Difference]: Without dead ends: 221 [2018-01-21 01:03:11,420 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-21 01:03:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-21 01:03:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2018-01-21 01:03:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-21 01:03:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2018-01-21 01:03:11,440 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 55 [2018-01-21 01:03:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:11,441 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2018-01-21 01:03:11,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 01:03:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2018-01-21 01:03:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-21 01:03:11,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:11,443 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, 1, 1, 1, 1, 1, 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-21 01:03:11,443 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1108291151, now seen corresponding path program 2 times [2018-01-21 01:03:11,443 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:11,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:11,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:11,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:11,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:11,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:03:11,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:11,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 01:03:11,538 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:11,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:03:11,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:03:11,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:03:11,539 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand 4 states. [2018-01-21 01:03:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:11,640 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-01-21 01:03:11,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:03:11,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-01-21 01:03:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:11,642 INFO L225 Difference]: With dead ends: 162 [2018-01-21 01:03:11,642 INFO L226 Difference]: Without dead ends: 151 [2018-01-21 01:03:11,643 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:03:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-21 01:03:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2018-01-21 01:03:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-21 01:03:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2018-01-21 01:03:11,656 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 62 [2018-01-21 01:03:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:11,657 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2018-01-21 01:03:11,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:03:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2018-01-21 01:03:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-21 01:03:11,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:11,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:03:11,659 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:11,659 INFO L82 PathProgramCache]: Analyzing trace with hash -709572827, now seen corresponding path program 1 times [2018-01-21 01:03:11,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:11,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:11,661 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 01:03:11,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:11,661 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:11,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:03:12,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:03:12,213 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:03:12,213 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-01-21 01:03:12,213 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [9], [11], [14], [29], [33], [35], [36], [41], [45], [73], [78], [82], [88], [89], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [108], [112], [116], [118], [119], [120], [121], [122], [123], [127], [131], [135], [137], [138], [139], [147], [151], [156], [160], [166], [173], [175], [176], [180], [184], [188], [190], [191], [192], [193], [197], [198], [200], [201], [206], [207], [208], [209], [210] [2018-01-21 01:03:12,216 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:03:12,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:03:12,946 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:03:12,947 INFO L268 AbstractInterpreter]: Visited 69 different actions 176 times. Merged at 33 different actions 96 times. Widened at 1 different actions 3 times. Found 11 fixpoints after 5 different actions. Largest state had 48 variables. [2018-01-21 01:03:12,965 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:03:12,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:03:12,966 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-21 01:03:12,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:12,973 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:03:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:13,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:03:13,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:03:13,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-21 01:03:13,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2018-01-21 01:03:13,127 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 11554 column 44: unknown constant v_DerPreprocessor_1 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:582) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:105) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:297) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:239) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:198) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:998) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:942) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:573) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-21 01:03:13,130 INFO L168 Benchmark]: Toolchain (without parser) took 5592.08 ms. Allocated memory was 310.4 MB in the beginning and 557.3 MB in the end (delta: 246.9 MB). Free memory was 270.3 MB in the beginning and 477.2 MB in the end (delta: -206.9 MB). Peak memory consumption was 40.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:13,131 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 310.4 MB. Free memory is still 276.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:03:13,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.58 ms. Allocated memory is still 310.4 MB. Free memory was 269.3 MB in the beginning and 257.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:13,132 INFO L168 Benchmark]: Boogie Preprocessor took 44.93 ms. Allocated memory is still 310.4 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:13,132 INFO L168 Benchmark]: RCFGBuilder took 416.21 ms. Allocated memory is still 310.4 MB. Free memory was 255.3 MB in the beginning and 226.1 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:13,132 INFO L168 Benchmark]: TraceAbstraction took 4900.42 ms. Allocated memory was 310.4 MB in the beginning and 557.3 MB in the end (delta: 246.9 MB). Free memory was 226.1 MB in the beginning and 477.2 MB in the end (delta: -251.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:03:13,134 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.17 ms. Allocated memory is still 310.4 MB. Free memory is still 276.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.58 ms. Allocated memory is still 310.4 MB. Free memory was 269.3 MB in the beginning and 257.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.93 ms. Allocated memory is still 310.4 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 416.21 ms. Allocated memory is still 310.4 MB. Free memory was 255.3 MB in the beginning and 226.1 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4900.42 ms. Allocated memory was 310.4 MB in the beginning and 557.3 MB in the end (delta: 246.9 MB). Free memory was 226.1 MB in the beginning and 477.2 MB in the end (delta: -251.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 53 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 633 LocStat_NO_SUPPORTING_DISEQUALITIES : 204 LocStat_NO_DISJUNCTIONS : -106 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 58 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 98 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 62 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.143969 RENAME_VARIABLES(MILLISECONDS) : 0.082158 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.105054 PROJECTAWAY(MILLISECONDS) : 0.039505 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001391 DISJOIN(MILLISECONDS) : 0.927903 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.102302 ADD_EQUALITY(MILLISECONDS) : 0.034448 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014202 #CONJOIN_DISJUNCTIVE : 127 #RENAME_VARIABLES : 195 #UNFREEZE : 0 #CONJOIN : 209 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 188 #ADD_EQUALITY : 140 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 66 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 747 LocStat_NO_SUPPORTING_DISEQUALITIES : 253 LocStat_NO_DISJUNCTIONS : -132 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 73 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 129 TransStat_NO_SUPPORTING_DISEQUALITIES : 24 TransStat_NO_DISJUNCTIONS : 83 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.659563 RENAME_VARIABLES(MILLISECONDS) : 0.022475 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.445335 PROJECTAWAY(MILLISECONDS) : 1.891369 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001849 DISJOIN(MILLISECONDS) : 0.674782 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.043011 ADD_EQUALITY(MILLISECONDS) : 0.015263 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014571 #CONJOIN_DISJUNCTIVE : 288 #RENAME_VARIABLES : 568 #UNFREEZE : 0 #CONJOIN : 468 #PROJECTAWAY : 375 #ADD_WEAK_EQUALITY : 66 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 517 #ADD_EQUALITY : 161 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 17 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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, 92 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=92occurred 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 - ExceptionOrErrorResult: SMTLIBException: line 11554 column 44: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 11554 column 44: unknown constant v_DerPreprocessor_1: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-03-13-144.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-03-13-144.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-03-13-144.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_01-03-13-144.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_01-03-13-144.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-03-13-144.csv Received shutdown request...