java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:38:13,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:38:13,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:38:13,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:38:13,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:38:13,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:38:13,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:38:13,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:38:13,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:38:13,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:38:13,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:38:13,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:38:13,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:38:13,549 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:38:13,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:38:13,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:38:13,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:38:13,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:38:13,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:38:13,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:38:13,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:38:13,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:38:13,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:38:13,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:38:13,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:38:13,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:38:13,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:38:13,566 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:38:13,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:38:13,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:38:13,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:38:13,567 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:38:13,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:38:13,576 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:38:13,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:38:13,576 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:38:13,577 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:38:13,577 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:38:13,577 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:38:13,577 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:38:13,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:38:13,578 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:38:13,578 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:38:13,578 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:38:13,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:38:13,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:38:13,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:38:13,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:38:13,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:38:13,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:38:13,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:38:13,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:38:13,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:38:13,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:38:13,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:38:13,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:38:13,580 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:38:13,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:38:13,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:38:13,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:38:13,581 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:38:13,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:38:13,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:38:13,581 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:38:13,581 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:38:13,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:38:13,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:38:13,581 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:38:13,582 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:38:13,582 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:38:13,582 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:38:13,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:38:13,625 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:38:13,628 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:38:13,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:38:13,630 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:38:13,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i [2018-01-21 00:38:13,792 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:38:13,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:38:13,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:38:13,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:38:13,826 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:38:13,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:38:13" (1/1) ... [2018-01-21 00:38:13,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b09386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:13, skipping insertion in model container [2018-01-21 00:38:13,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:38:13" (1/1) ... [2018-01-21 00:38:13,849 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:38:13,893 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:38:14,021 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:38:14,052 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:38:14,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14 WrapperNode [2018-01-21 00:38:14,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:38:14,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:38:14,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:38:14,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:38:14,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (1/1) ... [2018-01-21 00:38:14,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (1/1) ... [2018-01-21 00:38:14,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (1/1) ... [2018-01-21 00:38:14,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (1/1) ... [2018-01-21 00:38:14,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (1/1) ... [2018-01-21 00:38:14,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (1/1) ... [2018-01-21 00:38:14,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (1/1) ... [2018-01-21 00:38:14,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:38:14,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:38:14,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:38:14,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:38:14,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:38:14,151 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:38:14,152 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:38:14,152 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:38:14,152 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:38:14,152 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:38:14,152 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:38:14,152 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:38:14,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:38:14,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:38:14,152 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:38:14,152 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:38:14,153 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 00:38:14,153 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:38:14,153 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:38:14,153 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:38:14,153 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:38:14,672 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:38:14,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:38:14 BoogieIcfgContainer [2018-01-21 00:38:14,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:38:14,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:38:14,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:38:14,676 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:38:14,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:38:13" (1/3) ... [2018-01-21 00:38:14,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebfa1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:38:14, skipping insertion in model container [2018-01-21 00:38:14,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:14" (2/3) ... [2018-01-21 00:38:14,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebfa1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:38:14, skipping insertion in model container [2018-01-21 00:38:14,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:38:14" (3/3) ... [2018-01-21 00:38:14,679 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0521_true-valid-memsafety.i [2018-01-21 00:38:14,685 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:38:14,690 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:38:14,738 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:14,739 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:14,739 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:14,739 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:14,739 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:14,739 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:14,739 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:14,740 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:38:14,740 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 00:38:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:38:14,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:14,770 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:38:14,770 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:38:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash 373147, now seen corresponding path program 1 times [2018-01-21 00:38:14,777 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:14,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:14,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:14,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:14,829 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:14,885 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:38:14,891 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:14,897 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:14,897 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:14,897 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:14,897 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:14,897 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:14,897 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:14,898 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:14,898 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:38:14,898 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 00:38:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:38:14,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:14,905 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] [2018-01-21 00:38:14,905 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:14,906 INFO L82 PathProgramCache]: Analyzing trace with hash -26575740, now seen corresponding path program 1 times [2018-01-21 00:38:14,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:14,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:14,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:14,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:14,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:14,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:14,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:14,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:14,961 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:14,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:38:15,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:38:15,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:15,061 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 2 states. [2018-01-21 00:38:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:15,094 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-01-21 00:38:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:38:15,096 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 00:38:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:15,109 INFO L225 Difference]: With dead ends: 311 [2018-01-21 00:38:15,110 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 00:38:15,113 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 00:38:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-21 00:38:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-21 00:38:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2018-01-21 00:38:15,154 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 24 [2018-01-21 00:38:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:15,155 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2018-01-21 00:38:15,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:38:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2018-01-21 00:38:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:38:15,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:15,157 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:15,157 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1949893135, now seen corresponding path program 1 times [2018-01-21 00:38:15,157 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:15,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:15,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,159 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:15,196 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:38:15,204 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:15,205 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,206 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,206 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,206 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,206 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,206 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,207 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,207 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,207 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,207 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,207 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,208 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,208 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,208 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,208 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,209 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,209 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,209 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,210 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,210 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,210 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,211 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,211 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,211 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,212 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,212 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,212 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,212 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,213 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,213 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,213 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,213 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,214 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,214 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,214 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,214 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,214 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,214 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,215 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,215 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,215 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,215 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,215 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,215 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,216 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,216 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,216 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,216 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,216 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,216 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,217 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,217 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,217 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,217 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,217 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,217 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,218 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,218 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,218 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:15,218 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,218 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,218 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,219 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 00:38:15,219 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:15,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 00:38:15,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 00:38:15,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 00:38:15,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 00:38:15,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 00:38:15,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 00:38:15,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 00:38:15,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 00:38:15,234 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:15,234 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:15,234 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:15,234 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:15,234 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:15,234 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:15,234 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:15,234 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:38:15,234 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 00:38:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:38:15,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:15,237 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] [2018-01-21 00:38:15,237 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1595501289, now seen corresponding path program 1 times [2018-01-21 00:38:15,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:15,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:15,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:15,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:15,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:15,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:15,258 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:15,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:38:15,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:38:15,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:15,259 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 2 states. [2018-01-21 00:38:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:15,270 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-01-21 00:38:15,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:38:15,270 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 00:38:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:15,271 INFO L225 Difference]: With dead ends: 311 [2018-01-21 00:38:15,271 INFO L226 Difference]: Without dead ends: 154 [2018-01-21 00:38:15,272 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-21 00:38:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-21 00:38:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-21 00:38:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2018-01-21 00:38:15,280 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 22 [2018-01-21 00:38:15,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:15,281 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2018-01-21 00:38:15,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:38:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2018-01-21 00:38:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 00:38:15,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:15,282 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-21 00:38:15,282 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash -359570538, now seen corresponding path program 1 times [2018-01-21 00:38:15,282 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:15,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:15,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,283 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:15,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:15,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:15,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:15,348 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:15,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:38:15,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:38:15,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:15,349 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand 3 states. [2018-01-21 00:38:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:15,436 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2018-01-21 00:38:15,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:38:15,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-21 00:38:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:15,439 INFO L225 Difference]: With dead ends: 243 [2018-01-21 00:38:15,439 INFO L226 Difference]: Without dead ends: 240 [2018-01-21 00:38:15,440 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 00:38:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-21 00:38:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 228. [2018-01-21 00:38:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-21 00:38:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 276 transitions. [2018-01-21 00:38:15,455 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 276 transitions. Word has length 30 [2018-01-21 00:38:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:15,456 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 276 transitions. [2018-01-21 00:38:15,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:38:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 276 transitions. [2018-01-21 00:38:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 00:38:15,458 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:15,458 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:15,458 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:15,459 INFO L82 PathProgramCache]: Analyzing trace with hash -123063933, now seen corresponding path program 1 times [2018-01-21 00:38:15,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:15,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:15,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,460 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:15,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:15,588 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-21 00:38:15,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:15,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:38:15,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:15,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:38:15,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:38:15,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:38:15,590 INFO L87 Difference]: Start difference. First operand 228 states and 276 transitions. Second operand 4 states. [2018-01-21 00:38:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:15,674 INFO L93 Difference]: Finished difference Result 489 states and 587 transitions. [2018-01-21 00:38:15,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:38:15,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-21 00:38:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:15,677 INFO L225 Difference]: With dead ends: 489 [2018-01-21 00:38:15,677 INFO L226 Difference]: Without dead ends: 313 [2018-01-21 00:38:15,679 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-21 00:38:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 236. [2018-01-21 00:38:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-01-21 00:38:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2018-01-21 00:38:15,694 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 40 [2018-01-21 00:38:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:15,695 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2018-01-21 00:38:15,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:38:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2018-01-21 00:38:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 00:38:15,696 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:15,697 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, 1, 1, 1, 1, 1] [2018-01-21 00:38:15,697 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 90705220, now seen corresponding path program 1 times [2018-01-21 00:38:15,697 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:15,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:15,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:15,698 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:15,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:15,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:15,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:38:15,806 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:15,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:38:15,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:38:15,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:38:15,808 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 6 states. [2018-01-21 00:38:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:15,998 INFO L93 Difference]: Finished difference Result 594 states and 707 transitions. [2018-01-21 00:38:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 00:38:15,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-21 00:38:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:16,000 INFO L225 Difference]: With dead ends: 594 [2018-01-21 00:38:16,001 INFO L226 Difference]: Without dead ends: 466 [2018-01-21 00:38:16,001 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:38:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-21 00:38:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 242. [2018-01-21 00:38:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-21 00:38:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2018-01-21 00:38:16,015 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 46 [2018-01-21 00:38:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:16,016 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2018-01-21 00:38:16,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:38:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2018-01-21 00:38:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 00:38:16,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:16,018 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:16,018 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash 166146402, now seen corresponding path program 1 times [2018-01-21 00:38:16,018 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:16,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:16,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:16,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:16,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:16,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:38:16,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:16,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:38:16,048 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:16,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:38:16,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:38:16,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:16,049 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand 3 states. [2018-01-21 00:38:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:16,081 INFO L93 Difference]: Finished difference Result 394 states and 475 transitions. [2018-01-21 00:38:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:38:16,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-21 00:38:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:16,082 INFO L225 Difference]: With dead ends: 394 [2018-01-21 00:38:16,082 INFO L226 Difference]: Without dead ends: 244 [2018-01-21 00:38:16,083 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-21 00:38:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-21 00:38:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-01-21 00:38:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-21 00:38:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2018-01-21 00:38:16,093 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 47 [2018-01-21 00:38:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:16,093 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2018-01-21 00:38:16,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:38:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2018-01-21 00:38:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 00:38:16,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:16,094 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:16,094 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash -987135777, now seen corresponding path program 1 times [2018-01-21 00:38:16,095 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:16,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:16,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:16,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:16,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:16,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 00:38:16,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:16,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:38:16,182 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:16,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:38:16,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:38:16,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:16,183 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand 5 states. [2018-01-21 00:38:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:16,268 INFO L93 Difference]: Finished difference Result 363 states and 429 transitions. [2018-01-21 00:38:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 00:38:16,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-21 00:38:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:16,270 INFO L225 Difference]: With dead ends: 363 [2018-01-21 00:38:16,270 INFO L226 Difference]: Without dead ends: 178 [2018-01-21 00:38:16,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:38:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-21 00:38:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2018-01-21 00:38:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-21 00:38:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2018-01-21 00:38:16,279 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 49 [2018-01-21 00:38:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:16,279 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2018-01-21 00:38:16,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:38:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2018-01-21 00:38:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-21 00:38:16,280 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:16,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:16,281 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1230398727, now seen corresponding path program 1 times [2018-01-21 00:38:16,281 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:16,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:16,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:16,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:16,287 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:16,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:16,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:16,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 00:38:16,397 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:16,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 00:38:16,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 00:38:16,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:38:16,398 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand 7 states. [2018-01-21 00:38:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:16,655 INFO L93 Difference]: Finished difference Result 439 states and 510 transitions. [2018-01-21 00:38:16,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:38:16,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-21 00:38:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:16,658 INFO L225 Difference]: With dead ends: 439 [2018-01-21 00:38:16,658 INFO L226 Difference]: Without dead ends: 334 [2018-01-21 00:38:16,659 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-21 00:38:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-21 00:38:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 208. [2018-01-21 00:38:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-21 00:38:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 245 transitions. [2018-01-21 00:38:16,670 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 245 transitions. Word has length 51 [2018-01-21 00:38:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:16,671 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 245 transitions. [2018-01-21 00:38:16,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 00:38:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 245 transitions. [2018-01-21 00:38:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-21 00:38:16,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:16,672 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:16,673 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:16,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1850402931, now seen corresponding path program 1 times [2018-01-21 00:38:16,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:16,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:16,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:16,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:16,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:16,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 00:38:16,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:16,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:38:16,808 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:16,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:38:16,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:38:16,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:38:16,809 INFO L87 Difference]: Start difference. First operand 208 states and 245 transitions. Second operand 8 states. [2018-01-21 00:38:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:17,270 INFO L93 Difference]: Finished difference Result 597 states and 689 transitions. [2018-01-21 00:38:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-21 00:38:17,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-01-21 00:38:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:17,274 INFO L225 Difference]: With dead ends: 597 [2018-01-21 00:38:17,274 INFO L226 Difference]: Without dead ends: 492 [2018-01-21 00:38:17,275 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-01-21 00:38:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-01-21 00:38:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 262. [2018-01-21 00:38:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-01-21 00:38:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 306 transitions. [2018-01-21 00:38:17,297 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 306 transitions. Word has length 65 [2018-01-21 00:38:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:17,298 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 306 transitions. [2018-01-21 00:38:17,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:38:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2018-01-21 00:38:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-21 00:38:17,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:17,299 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:17,299 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 835647732, now seen corresponding path program 1 times [2018-01-21 00:38:17,300 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:17,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:17,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:17,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:17,301 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:17,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:38:17,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:17,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 00:38:17,399 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:17,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 00:38:17,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 00:38:17,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:38:17,400 INFO L87 Difference]: Start difference. First operand 262 states and 306 transitions. Second operand 7 states. [2018-01-21 00:38:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:17,568 INFO L93 Difference]: Finished difference Result 451 states and 522 transitions. [2018-01-21 00:38:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:38:17,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-01-21 00:38:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:17,571 INFO L225 Difference]: With dead ends: 451 [2018-01-21 00:38:17,571 INFO L226 Difference]: Without dead ends: 398 [2018-01-21 00:38:17,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-21 00:38:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-21 00:38:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 265. [2018-01-21 00:38:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-01-21 00:38:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 309 transitions. [2018-01-21 00:38:17,584 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 309 transitions. Word has length 66 [2018-01-21 00:38:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:17,584 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 309 transitions. [2018-01-21 00:38:17,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 00:38:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 309 transitions. [2018-01-21 00:38:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-21 00:38:17,585 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:17,585 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:17,585 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash -475061263, now seen corresponding path program 1 times [2018-01-21 00:38:17,586 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:17,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:17,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:17,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:17,587 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:17,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:38:17,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:17,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-21 00:38:17,785 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:17,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 00:38:17,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 00:38:17,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-21 00:38:17,785 INFO L87 Difference]: Start difference. First operand 265 states and 309 transitions. Second operand 12 states. [2018-01-21 00:38:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:18,526 INFO L93 Difference]: Finished difference Result 383 states and 446 transitions. [2018-01-21 00:38:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 00:38:18,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-01-21 00:38:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:18,528 INFO L225 Difference]: With dead ends: 383 [2018-01-21 00:38:18,528 INFO L226 Difference]: Without dead ends: 364 [2018-01-21 00:38:18,529 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2018-01-21 00:38:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-21 00:38:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 287. [2018-01-21 00:38:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-01-21 00:38:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 334 transitions. [2018-01-21 00:38:18,537 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 334 transitions. Word has length 68 [2018-01-21 00:38:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:18,537 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 334 transitions. [2018-01-21 00:38:18,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 00:38:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 334 transitions. [2018-01-21 00:38:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-21 00:38:18,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:18,538 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:18,538 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1235268699, now seen corresponding path program 1 times [2018-01-21 00:38:18,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:18,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:18,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:18,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:18,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:18,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-21 00:38:18,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:18,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-21 00:38:18,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:18,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-21 00:38:18,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-21 00:38:18,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-01-21 00:38:18,854 INFO L87 Difference]: Start difference. First operand 287 states and 334 transitions. Second operand 14 states. [2018-01-21 00:38:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:19,577 INFO L93 Difference]: Finished difference Result 445 states and 523 transitions. [2018-01-21 00:38:19,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-21 00:38:19,577 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-01-21 00:38:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:19,578 INFO L225 Difference]: With dead ends: 445 [2018-01-21 00:38:19,578 INFO L226 Difference]: Without dead ends: 374 [2018-01-21 00:38:19,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-01-21 00:38:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-01-21 00:38:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 302. [2018-01-21 00:38:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-01-21 00:38:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 351 transitions. [2018-01-21 00:38:19,588 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 351 transitions. Word has length 74 [2018-01-21 00:38:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:19,588 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 351 transitions. [2018-01-21 00:38:19,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-21 00:38:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 351 transitions. [2018-01-21 00:38:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-21 00:38:19,589 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:19,589 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:19,589 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 906430885, now seen corresponding path program 1 times [2018-01-21 00:38:19,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:19,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:19,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:19,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:19,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:19,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-21 00:38:19,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:19,697 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:19,698 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-01-21 00:38:19,699 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [21], [22], [23], [24], [25], [30], [32], [33], [34], [38], [41], [42], [43], [47], [52], [53], [54], [57], [74], [78], [80], [85], [86], [87], [90], [108], [112], [114], [117], [118], [119], [125], [231], [234], [235], [236], [240], [245], [246], [247], [250], [267], [271], [273], [278], [279], [280], [283], [303], [307], [309], [310], [311], [312], [313], [317], [321], [331], [332], [336], [338], [339], [340], [346], [347], [348] [2018-01-21 00:38:19,746 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:38:19,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:38:20,366 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 00:38:20,369 INFO L168 Benchmark]: Toolchain (without parser) took 6576.89 ms. Allocated memory was 307.2 MB in the beginning and 559.4 MB in the end (delta: 252.2 MB). Free memory was 266.2 MB in the beginning and 361.2 MB in the end (delta: -95.1 MB). Peak memory consumption was 157.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:20,370 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:38:20,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.70 ms. Allocated memory is still 307.2 MB. Free memory was 266.2 MB in the beginning and 254.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:20,371 INFO L168 Benchmark]: Boogie Preprocessor took 39.42 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 250.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:20,371 INFO L168 Benchmark]: RCFGBuilder took 571.41 ms. Allocated memory is still 307.2 MB. Free memory was 250.2 MB in the beginning and 207.2 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:20,371 INFO L168 Benchmark]: TraceAbstraction took 5694.79 ms. Allocated memory was 307.2 MB in the beginning and 559.4 MB in the end (delta: 252.2 MB). Free memory was 207.2 MB in the beginning and 361.2 MB in the end (delta: -154.0 MB). Peak memory consumption was 98.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:20,373 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.12 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.70 ms. Allocated memory is still 307.2 MB. Free memory was 266.2 MB in the beginning and 254.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.42 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 250.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 571.41 ms. Allocated memory is still 307.2 MB. Free memory was 250.2 MB in the beginning and 207.2 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5694.79 ms. Allocated memory was 307.2 MB in the beginning and 559.4 MB in the end (delta: 252.2 MB). Free memory was 207.2 MB in the beginning and 361.2 MB in the end (delta: -154.0 MB). Peak memory consumption was 98.2 MB. Max. memory is 5.3 GB. * 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 Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 159 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred 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: [L634] struct list *data = ((void *)0); VAL [data={0:0}] [L636] COND FALSE !(__VERIFIER_nondet_int()) [L652] struct iterator iter; [L654] struct list *list = data; [L655] EXPR iter.list = list VAL [data={0:0}, iter={0:0}, list={0:0}] [L655] COND FALSE !((iter.list = list)) VAL [data={0:0}, iter={0:0}, list={0:0}] [L658] struct node *node; VAL [data={0:0}, iter={0:0}, list={0:0}] [L660] COND TRUE !iter.list [L661] node = ((void *)0) VAL [data={0:0}, iter={0:0}, list={0:0}, node={0:0}] [L673] COND FALSE !((node)) VAL [data={0:0}, iter={0:0}, list={0:0}, node={0:0}] [L692] struct list *list = data; VAL [data={0:0}, iter={0:0}, list={0:0}, list={0:0}, node={0:0}] [L693] list && list->next VAL [data={0:0}, iter={0:0}, list={0:0}, list={0:0}, list && list->next=0, node={0:0}] [L693] COND FALSE !(list && list->next) [L726] data = list [L729] struct iterator iter; [L731] struct list *list = data; [L732] EXPR iter.list = list VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L732] COND FALSE !((iter.list = list)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L735] struct node *node; VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L737] COND TRUE !iter.list [L738] node = ((void *)0) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L750] COND FALSE !((node)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L769] COND FALSE !(\read(*data)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L781] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 159 locations, 3 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 186 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=159occurred 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, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 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 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-38-20-382.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-38-20-382.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-38-20-382.csv Received shutdown request...