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/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:24:33,609 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:24:33,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:24:33,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:24:33,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:24:33,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:24:33,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:24:33,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:24:33,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:24:33,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:24:33,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:24:33,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:24:33,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:24:33,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:24:33,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:24:33,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:24:33,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:24:33,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:24:33,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:24:33,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:24:33,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:24:33,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:24:33,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:24:33,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:24:33,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:24:33,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:24:33,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:24:33,655 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:24:33,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:24:33,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:24:33,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:24:33,656 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:24:33,666 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:24:33,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:24:33,667 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:24:33,667 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:24:33,668 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:24:33,668 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:24:33,668 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:24:33,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:24:33,669 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:24:33,669 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:24:33,669 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:24:33,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:24:33,670 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:24:33,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:24:33,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:24:33,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:24:33,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:24:33,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:24:33,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:24:33,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:24:33,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:24:33,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:24:33,671 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:24:33,672 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:24:33,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:24:33,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:24:33,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:24:33,672 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:24:33,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:24:33,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:24:33,673 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:24:33,673 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:24:33,673 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:24:33,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:24:33,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:24:33,674 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:24:33,675 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:24:33,675 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:24:33,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:24:33,723 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:24:33,728 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:24:33,730 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:24:33,730 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:24:33,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-01-20 23:24:33,899 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:24:33,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:24:33,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:24:33,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:24:33,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:24:33,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:24:33" (1/1) ... [2018-01-20 23:24:33,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2fa6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:33, skipping insertion in model container [2018-01-20 23:24:33,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:24:33" (1/1) ... [2018-01-20 23:24:33,928 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:24:33,966 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:24:34,090 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:24:34,112 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:24:34,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34 WrapperNode [2018-01-20 23:24:34,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:24:34,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:24:34,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:24:34,121 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:24:34,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (1/1) ... [2018-01-20 23:24:34,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (1/1) ... [2018-01-20 23:24:34,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (1/1) ... [2018-01-20 23:24:34,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (1/1) ... [2018-01-20 23:24:34,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (1/1) ... [2018-01-20 23:24:34,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (1/1) ... [2018-01-20 23:24:34,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (1/1) ... [2018-01-20 23:24:34,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:24:34,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:24:34,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:24:34,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:24:34,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (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:24:34,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:24:34,232 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:24:34,232 INFO L136 BoogieDeclarations]: Found implementation of procedure diff [2018-01-20 23:24:34,232 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:24:34,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:24:34,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:24:34,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:24:34,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:24:34,233 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:24:34,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:24:34,233 INFO L128 BoogieDeclarations]: Found specification of procedure diff [2018-01-20 23:24:34,233 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:24:34,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:24:34,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:24:34,451 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:24:34,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:24:34 BoogieIcfgContainer [2018-01-20 23:24:34,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:24:34,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:24:34,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:24:34,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:24:34,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:24:33" (1/3) ... [2018-01-20 23:24:34,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1b6b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:24:34, skipping insertion in model container [2018-01-20 23:24:34,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:34" (2/3) ... [2018-01-20 23:24:34,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1b6b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:24:34, skipping insertion in model container [2018-01-20 23:24:34,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:24:34" (3/3) ... [2018-01-20 23:24:34,457 INFO L105 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-01-20 23:24:34,464 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:24:34,470 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 23:24:34,501 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:34,501 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:34,501 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:34,501 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:34,501 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:34,501 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:34,501 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:34,501 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:24:34,502 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 23:24:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:24:34,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:34,528 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:24:34,528 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:24:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-20 23:24:34,536 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:34,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:34,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:34,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:34,581 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:34,630 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:24:34,635 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:34,642 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:34,642 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:34,642 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:34,642 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:34,642 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:34,642 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:34,642 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:34,642 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:24:34,642 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 23:24:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 23:24:34,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:34,645 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] [2018-01-20 23:24:34,645 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash 661572557, now seen corresponding path program 1 times [2018-01-20 23:24:34,646 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:34,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:34,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:34,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:34,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:34,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:34,738 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:24:34,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:34,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:24:34,740 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:34,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:24:34,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:24:34,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:34,832 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 23:24:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:34,853 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-01-20 23:24:34,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:24:34,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-20 23:24:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:34,864 INFO L225 Difference]: With dead ends: 72 [2018-01-20 23:24:34,864 INFO L226 Difference]: Without dead ends: 41 [2018-01-20 23:24:34,866 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:24:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-20 23:24:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-20 23:24:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 23:24:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 23:24:34,897 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-01-20 23:24:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:34,898 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 23:24:34,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:24:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 23:24:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 23:24:34,899 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:34,899 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] [2018-01-20 23:24:34,899 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:34,900 INFO L82 PathProgramCache]: Analyzing trace with hash -853617319, now seen corresponding path program 1 times [2018-01-20 23:24:34,900 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:34,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:34,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:34,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:34,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:34,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:35,045 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:24:35,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:35,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:24:35,046 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:35,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:24:35,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:24:35,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:24:35,048 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-20 23:24:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:35,138 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-01-20 23:24:35,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:24:35,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-20 23:24:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:35,140 INFO L225 Difference]: With dead ends: 66 [2018-01-20 23:24:35,140 INFO L226 Difference]: Without dead ends: 53 [2018-01-20 23:24:35,141 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:24:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-20 23:24:35,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-01-20 23:24:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 23:24:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 23:24:35,148 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 30 [2018-01-20 23:24:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:35,149 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 23:24:35,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:24:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 23:24:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 23:24:35,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:35,150 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] [2018-01-20 23:24:35,150 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:35,151 INFO L82 PathProgramCache]: Analyzing trace with hash 167900261, now seen corresponding path program 1 times [2018-01-20 23:24:35,151 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:35,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:35,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:35,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:35,153 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:35,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:35,212 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:24:35,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:35,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:24:35,213 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:35,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:24:35,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:24:35,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:24:35,214 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-01-20 23:24:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:35,238 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-01-20 23:24:35,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:24:35,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-20 23:24:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:35,243 INFO L225 Difference]: With dead ends: 76 [2018-01-20 23:24:35,243 INFO L226 Difference]: Without dead ends: 51 [2018-01-20 23:24:35,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:24:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-20 23:24:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-01-20 23:24:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-20 23:24:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-20 23:24:35,252 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 36 [2018-01-20 23:24:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:35,253 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-20 23:24:35,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:24:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-20 23:24:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 23:24:35,254 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:35,254 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] [2018-01-20 23:24:35,255 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:35,255 INFO L82 PathProgramCache]: Analyzing trace with hash 562606371, now seen corresponding path program 1 times [2018-01-20 23:24:35,255 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:35,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:35,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:35,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:35,256 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:35,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:35,358 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:24:35,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:24:35,359 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:24:35,359 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-20 23:24:35,361 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [11], [15], [17], [21], [25], [41], [42], [43], [44], [48], [52], [54], [57], [65], [67], [68], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88] [2018-01-20 23:24:35,405 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:24:35,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:24:37,127 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:24:37,128 INFO L268 AbstractInterpreter]: Visited 38 different actions 59 times. Merged at 11 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 35 variables. [2018-01-20 23:24:37,150 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:24:37,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:24:37,151 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:24:37,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:37,160 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:24:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:37,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:24:37,243 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:24:37,243 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:24:37,644 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:24:37,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-20 23:24:37,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 9 [2018-01-20 23:24:37,667 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:37,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:24:37,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:24:37,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 23:24:37,668 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-01-20 23:24:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:37,810 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-01-20 23:24:37,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:24:37,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-20 23:24:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:37,812 INFO L225 Difference]: With dead ends: 76 [2018-01-20 23:24:37,812 INFO L226 Difference]: Without dead ends: 48 [2018-01-20 23:24:37,812 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:24:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-20 23:24:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-20 23:24:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-20 23:24:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-20 23:24:37,823 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 39 [2018-01-20 23:24:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:37,823 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-20 23:24:37,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:24:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-20 23:24:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-20 23:24:37,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:37,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:37,825 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:37,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1644277160, now seen corresponding path program 1 times [2018-01-20 23:24:37,826 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:37,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:37,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:37,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:37,827 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:37,883 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:24:37,896 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:37,904 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:37,907 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:37,907 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:37,924 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:37,924 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:37,924 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:37,924 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:37,924 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:37,925 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:37,925 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:37,925 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == diffErr0EnsuresViolation======== [2018-01-20 23:24:37,925 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 23:24:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 23:24:37,926 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:37,926 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:24:37,926 INFO L371 AbstractCegarLoop]: === Iteration 1 === [diffErr0EnsuresViolation]=== [2018-01-20 23:24:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash -20991072, now seen corresponding path program 1 times [2018-01-20 23:24:37,926 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:37,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:37,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:37,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:37,927 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:37,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:37,949 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:24:37,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:37,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:24:37,949 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:37,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:24:37,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:24:37,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:37,950 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 23:24:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:37,954 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-01-20 23:24:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:24:37,954 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 23:24:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:37,955 INFO L225 Difference]: With dead ends: 72 [2018-01-20 23:24:37,955 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:24:37,955 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:24:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:24:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:24:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:24:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:24:37,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-20 23:24:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:37,956 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:24:37,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:24:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:24:37,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:24:37,959 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:37,959 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:37,959 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:37,959 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:37,959 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:37,959 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:37,959 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:37,960 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:24:37,960 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 23:24:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:24:37,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:37,962 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] [2018-01-20 23:24:37,962 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:37,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1073312926, now seen corresponding path program 1 times [2018-01-20 23:24:37,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:37,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:37,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:37,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:37,963 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:37,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:37,984 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:24:37,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:37,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:24:37,985 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:37,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:24:37,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:24:37,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:37,985 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 23:24:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:37,989 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-01-20 23:24:37,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:24:37,989 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-20 23:24:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:37,990 INFO L225 Difference]: With dead ends: 72 [2018-01-20 23:24:37,990 INFO L226 Difference]: Without dead ends: 39 [2018-01-20 23:24:37,991 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:24:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-20 23:24:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-20 23:24:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-20 23:24:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-01-20 23:24:37,995 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2018-01-20 23:24:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:37,995 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-01-20 23:24:37,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:24:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-01-20 23:24:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 23:24:37,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:37,996 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] [2018-01-20 23:24:37,996 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash 821457194, now seen corresponding path program 1 times [2018-01-20 23:24:37,997 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:37,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:37,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:37,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:37,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:38,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:38,065 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:24:38,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:38,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:24:38,066 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:38,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:24:38,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:24:38,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:24:38,067 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-01-20 23:24:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:38,104 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-01-20 23:24:38,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:24:38,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-20 23:24:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:38,108 INFO L225 Difference]: With dead ends: 62 [2018-01-20 23:24:38,108 INFO L226 Difference]: Without dead ends: 51 [2018-01-20 23:24:38,109 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:24:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-20 23:24:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-01-20 23:24:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 23:24:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 23:24:38,113 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 28 [2018-01-20 23:24:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:38,113 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 23:24:38,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:24:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 23:24:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 23:24:38,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:38,114 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] [2018-01-20 23:24:38,115 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash -840047818, now seen corresponding path program 1 times [2018-01-20 23:24:38,115 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:38,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:38,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:38,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:38,116 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:38,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:38,155 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:24:38,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:38,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:24:38,156 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:38,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:24:38,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:24:38,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:24:38,157 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-01-20 23:24:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:38,194 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-01-20 23:24:38,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:24:38,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-20 23:24:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:38,197 INFO L225 Difference]: With dead ends: 72 [2018-01-20 23:24:38,197 INFO L226 Difference]: Without dead ends: 49 [2018-01-20 23:24:38,197 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:24:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-20 23:24:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-01-20 23:24:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-20 23:24:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-01-20 23:24:38,201 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 34 [2018-01-20 23:24:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:38,202 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-01-20 23:24:38,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:24:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-01-20 23:24:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 23:24:38,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:38,202 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] [2018-01-20 23:24:38,202 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:38,203 INFO L82 PathProgramCache]: Analyzing trace with hash -187123852, now seen corresponding path program 1 times [2018-01-20 23:24:38,203 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:38,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:38,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:38,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:38,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:38,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:38,282 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:24:38,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:24:38,283 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:24:38,283 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-20 23:24:38,283 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [11], [15], [17], [21], [25], [41], [42], [43], [44], [48], [52], [54], [57], [65], [67], [68], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [82], [83], [84], [85], [87], [88] [2018-01-20 23:24:38,286 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:24:38,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:24:39,701 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:24:39,701 INFO L268 AbstractInterpreter]: Visited 36 different actions 57 times. Merged at 11 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 35 variables. [2018-01-20 23:24:39,707 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:24:39,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:24:39,708 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 23:24:39,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:39,734 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:24:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:39,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:24:39,805 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:24:39,805 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:24:39,941 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:24:39,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-20 23:24:39,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 9 [2018-01-20 23:24:39,977 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:39,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:24:39,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:24:39,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 23:24:39,978 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 6 states. [2018-01-20 23:24:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:40,077 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-01-20 23:24:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:24:40,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-20 23:24:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:40,079 INFO L225 Difference]: With dead ends: 72 [2018-01-20 23:24:40,079 INFO L226 Difference]: Without dead ends: 46 [2018-01-20 23:24:40,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:24:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-20 23:24:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-20 23:24:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-20 23:24:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-20 23:24:40,085 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 37 [2018-01-20 23:24:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:40,085 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-20 23:24:40,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:24:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-20 23:24:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 23:24:40,086 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:40,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:40,086 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:40,087 INFO L82 PathProgramCache]: Analyzing trace with hash -247520791, now seen corresponding path program 1 times [2018-01-20 23:24:40,087 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:40,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:40,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:40,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:40,088 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:40,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 23:24:40,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:40,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-20 23:24:40,513 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:40,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 23:24:40,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 23:24:40,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:24:40,514 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 10 states. [2018-01-20 23:24:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:40,835 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-01-20 23:24:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-20 23:24:40,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-20 23:24:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:40,836 INFO L225 Difference]: With dead ends: 78 [2018-01-20 23:24:40,836 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:24:40,837 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-20 23:24:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:24:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:24:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:24:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:24:40,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-01-20 23:24:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:40,837 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:24:40,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 23:24:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:24:40,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:24:40,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:24:40 BoogieIcfgContainer [2018-01-20 23:24:40,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:24:40,841 INFO L168 Benchmark]: Toolchain (without parser) took 6941.14 ms. Allocated memory was 305.7 MB in the beginning and 659.6 MB in the end (delta: 353.9 MB). Free memory was 264.0 MB in the beginning and 485.5 MB in the end (delta: -221.5 MB). Peak memory consumption was 132.4 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:40,842 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:24:40,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.16 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.9 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:24:40,842 INFO L168 Benchmark]: Boogie Preprocessor took 41.35 ms. Allocated memory is still 305.7 MB. Free memory was 252.9 MB in the beginning and 250.9 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:24:40,843 INFO L168 Benchmark]: RCFGBuilder took 288.51 ms. Allocated memory is still 305.7 MB. Free memory was 250.9 MB in the beginning and 233.3 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:40,843 INFO L168 Benchmark]: TraceAbstraction took 6388.28 ms. Allocated memory was 305.7 MB in the beginning and 659.6 MB in the end (delta: 353.9 MB). Free memory was 233.3 MB in the beginning and 485.5 MB in the end (delta: -252.2 MB). Peak memory consumption was 101.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:40,844 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.20 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.16 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.35 ms. Allocated memory is still 305.7 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 288.51 ms. Allocated memory is still 305.7 MB. Free memory was 250.9 MB in the beginning and 233.3 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6388.28 ms. Allocated memory was 305.7 MB in the beginning and 659.6 MB in the end (delta: 353.9 MB). Free memory was 233.3 MB in the beginning and 485.5 MB in the end (delta: -252.2 MB). Peak memory consumption was 101.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 37 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 599 LocStat_NO_SUPPORTING_DISEQUALITIES : 153 LocStat_NO_DISJUNCTIONS : -74 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 44 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 45 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.905138 RENAME_VARIABLES(MILLISECONDS) : 0.926138 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.829632 PROJECTAWAY(MILLISECONDS) : 0.224334 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.098971 DISJOIN(MILLISECONDS) : 0.613036 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.964218 ADD_EQUALITY(MILLISECONDS) : 0.044685 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009588 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 188 #UNFREEZE : 0 #CONJOIN : 170 #PROJECTAWAY : 153 #ADD_WEAK_EQUALITY : 12 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 183 #ADD_EQUALITY : 77 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 35 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 596 LocStat_NO_SUPPORTING_DISEQUALITIES : 153 LocStat_NO_DISJUNCTIONS : -70 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 42 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 74 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 43 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 6.012421 RENAME_VARIABLES(MILLISECONDS) : 1.212979 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 5.952265 PROJECTAWAY(MILLISECONDS) : 0.232910 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.078282 DISJOIN(MILLISECONDS) : 0.676203 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.255929 ADD_EQUALITY(MILLISECONDS) : 0.053719 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012836 #CONJOIN_DISJUNCTIVE : 94 #RENAME_VARIABLES : 181 #UNFREEZE : 0 #CONJOIN : 164 #PROJECTAWAY : 143 #ADD_WEAK_EQUALITY : 12 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 176 #ADD_EQUALITY : 75 #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) - 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 4 procedures, 45 locations, 4 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=45occurred 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: [L565] int Alen = __VERIFIER_nondet_int(); [L566] int Blen = __VERIFIER_nondet_int(); [L567] COND TRUE Alen < 1 || Alen >= 2147483647 / sizeof(int) [L568] Alen = 1 VAL [Alen=1, Blen=1] [L570] COND FALSE !(Blen < 1 || Blen >= 2147483647 / sizeof(int)) VAL [Alen=1, Blen=1] [L573] EXPR, FCALL __builtin_alloca (Alen * sizeof(int)) VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, Alen=1, Blen=1] [L573] int* A = (int*) __builtin_alloca (Alen * sizeof(int)); VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, A={536870916:0}, Alen=1, Blen=1] [L574] EXPR, FCALL __builtin_alloca (Blen * sizeof(int)) VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, Blen=1] [L574] int* B = (int*) __builtin_alloca (Blen * sizeof(int)); VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, B={536870919:0}, Blen=1] [L575] EXPR, FCALL __builtin_alloca (Alen * sizeof(int)) VAL [__builtin_alloca (Alen * sizeof(int))={536870917:0}, __builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, B={536870919:0}, Blen=1] [L575] int* D = (int*) __builtin_alloca (Alen * sizeof(int)); VAL [__builtin_alloca (Alen * sizeof(int))={536870917:0}, __builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, B={536870919:0}, Blen=1, D={536870917:0}] [L576] CALL diff(A, Alen, B, Blen, D) VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, B={536870919:0}, D={536870917:0}] [L542] int k = 0; [L543] int i = 0; [L544] int l1 = Alen; [L545] int l2 = Blen; [L546] int found; VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, i=0, k=0, l1=1, l2=1] [L547] COND TRUE i < l1 [L548] int j = 0; [L549] found = 0 VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=0, i=0, j=0, k=0, l1=1, l2=1] [L550] COND TRUE j < l2 && !found VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=0, i=0, j=0, k=0, l1=1, l2=1] [L551] EXPR, FCALL A[i] VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, A[i]=536870915, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=0, i=0, j=0, k=0, l1=1, l2=1] [L551] EXPR, FCALL B[j] VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, A[i]=536870915, Alen=1, B={536870919:0}, B={536870919:0}, B[j]=536870915, Blen=1, D={536870917:0}, D={536870917:0}, found=0, i=0, j=0, k=0, l1=1, l2=1] [L551] COND TRUE A[i] == B[j] [L552] found = 1 VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=0, j=0, k=0, l1=1, l2=1] [L550] COND FALSE !(j < l2 && !found) VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=0, j=0, k=0, l1=1, l2=1] [L557] COND FALSE !(!found) VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=0, j=0, k=0, l1=1, l2=1] [L561] i++ VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=1, j=0, k=0, l1=1, l2=1] [L547] COND FALSE, RET !(i < l1) VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=1, j=0, k=0, l1=1, l2=1] [L576] diff(A, Alen, B, Blen, D) VAL [__builtin_alloca (Alen * sizeof(int))={536870917:0}, __builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, B={536870919:0}, Blen=1, D={536870917:0}] [L577] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. UNSAFE Result, 3.2s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 89 SDslu, 234 SDs, 0 SdLazy, 64 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 14856 SizeOfPredicates, 6 NumberOfNonLiveVariables, 148 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: diffErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. SAFE Result, 2.8s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 208 SDtfs, 133 SDslu, 284 SDs, 0 SdLazy, 314 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 25112 SizeOfPredicates, 6 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 8/12 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/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-24-40-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-20_23-24-40-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-20_23-24-40-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-20_23-24-40-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-20_23-24-40-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-24-40-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-24-40-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-24-40-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-24-40-854.csv Received shutdown request...