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_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 08:37:44,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 08:37:44,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 08:37:44,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 08:37:44,853 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 08:37:44,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 08:37:44,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 08:37:44,855 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 08:37:44,857 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 08:37:44,858 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 08:37:44,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 08:37:44,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 08:37:44,859 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 08:37:44,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 08:37:44,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 08:37:44,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 08:37:44,866 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 08:37:44,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 08:37:44,869 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 08:37:44,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 08:37:44,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 08:37:44,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 08:37:44,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 08:37:44,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 08:37:44,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 08:37:44,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 08:37:44,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 08:37:44,878 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 08:37:44,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 08:37:44,879 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 08:37:44,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 08:37:44,880 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_preciseopt.epf [2018-01-21 08:37:44,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 08:37:44,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 08:37:44,892 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 08:37:44,892 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 08:37:44,892 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 08:37:44,892 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 08:37:44,892 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 08:37:44,893 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 08:37:44,893 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 08:37:44,893 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 08:37:44,894 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 08:37:44,894 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 08:37:44,894 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 08:37:44,894 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 08:37:44,894 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 08:37:44,895 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 08:37:44,895 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 08:37:44,895 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 08:37:44,895 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 08:37:44,895 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 08:37:44,896 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 08:37:44,896 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 08:37:44,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 08:37:44,896 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 08:37:44,896 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 08:37:44,897 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 08:37:44,897 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 08:37:44,897 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:37:44,897 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 08:37:44,898 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 08:37:44,898 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 08:37:44,898 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 08:37:44,898 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 08:37:44,898 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 08:37:44,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 08:37:44,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 08:37:44,899 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 08:37:44,899 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 08:37:44,900 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 08:37:44,900 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 08:37:44,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 08:37:44,948 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 08:37:44,952 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 08:37:44,953 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 08:37:44,954 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 08:37:44,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-21 08:37:45,139 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 08:37:45,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 08:37:45,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 08:37:45,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 08:37:45,154 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 08:37:45,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669ff2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45, skipping insertion in model container [2018-01-21 08:37:45,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,176 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:37:45,214 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:37:45,336 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:37:45,352 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:37:45,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45 WrapperNode [2018-01-21 08:37:45,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 08:37:45,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 08:37:45,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 08:37:45,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 08:37:45,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (1/1) ... [2018-01-21 08:37:45,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 08:37:45,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 08:37:45,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 08:37:45,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 08:37:45,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (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 08:37:45,452 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 08:37:45,452 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 08:37:45,452 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-21 08:37:45,452 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 08:37:45,452 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 08:37:45,452 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 08:37:45,453 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 08:37:45,453 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 08:37:45,453 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 08:37:45,453 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 08:37:45,453 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 08:37:45,453 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 08:37:45,453 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-21 08:37:45,453 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 08:37:45,454 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 08:37:45,454 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 08:37:45,662 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 08:37:45,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:37:45 BoogieIcfgContainer [2018-01-21 08:37:45,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 08:37:45,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 08:37:45,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 08:37:45,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 08:37:45,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 08:37:45" (1/3) ... [2018-01-21 08:37:45,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fad13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:37:45, skipping insertion in model container [2018-01-21 08:37:45,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:45" (2/3) ... [2018-01-21 08:37:45,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fad13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:37:45, skipping insertion in model container [2018-01-21 08:37:45,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:37:45" (3/3) ... [2018-01-21 08:37:45,669 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-21 08:37:45,676 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 08:37:45,683 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 08:37:45,728 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:37:45,728 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:37:45,728 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:37:45,728 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:37:45,728 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:37:45,728 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:37:45,728 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:37:45,729 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 08:37:45,729 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:37:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 08:37:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 08:37:45,756 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:45,757 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 08:37:45,757 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 08:37:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash 104751, now seen corresponding path program 1 times [2018-01-21 08:37:45,763 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:45,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:45,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:45,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:45,804 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:45,869 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:37:45,878 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:45,888 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:37:45,889 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:37:45,889 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:37:45,889 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:37:45,889 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:37:45,889 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:37:45,889 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:37:45,889 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-21 08:37:45,890 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:37:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 08:37:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 08:37:45,893 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:45,893 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:45,893 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-21 08:37:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash -387558155, now seen corresponding path program 1 times [2018-01-21 08:37:45,894 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:45,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:45,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:45,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:45,895 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:45,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:45,960 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 08:37:45,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:45,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:37:45,963 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:45,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:37:45,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:37:45,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:37:45,983 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 08:37:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:46,085 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 08:37:46,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:37:46,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 08:37:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:46,093 INFO L225 Difference]: With dead ends: 77 [2018-01-21 08:37:46,093 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:37:46,097 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 08:37:46,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:37:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:37:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:37:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:37:46,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-21 08:37:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:46,118 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:37:46,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:37:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:37:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:37:46,122 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:37:46,122 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:37:46,122 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:37:46,122 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:37:46,122 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:37:46,122 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:37:46,122 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:37:46,122 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 08:37:46,123 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:37:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 08:37:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 08:37:46,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:46,126 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:46,126 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:37:46,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1865714460, now seen corresponding path program 1 times [2018-01-21 08:37:46,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:46,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:46,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:46,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:46,164 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 08:37:46,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:46,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:37:46,164 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:46,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:37:46,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:37:46,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:37:46,165 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 08:37:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:46,172 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 08:37:46,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:37:46,172 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-21 08:37:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:46,174 INFO L225 Difference]: With dead ends: 77 [2018-01-21 08:37:46,175 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 08:37:46,175 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 08:37:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 08:37:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 08:37:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 08:37:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-21 08:37:46,185 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 29 [2018-01-21 08:37:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:46,186 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-21 08:37:46,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:37:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-21 08:37:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 08:37:46,187 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:46,187 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:46,187 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:37:46,188 INFO L82 PathProgramCache]: Analyzing trace with hash -880196222, now seen corresponding path program 1 times [2018-01-21 08:37:46,188 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:46,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:46,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,189 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:46,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:46,329 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 08:37:46,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:46,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:37:46,330 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:46,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:37:46,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:37:46,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:37:46,332 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-21 08:37:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:46,452 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-01-21 08:37:46,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 08:37:46,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-21 08:37:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:46,455 INFO L225 Difference]: With dead ends: 45 [2018-01-21 08:37:46,455 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 08:37:46,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-21 08:37:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 08:37:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-21 08:37:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 08:37:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-21 08:37:46,463 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2018-01-21 08:37:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:46,463 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-21 08:37:46,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:37:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-21 08:37:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 08:37:46,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:46,465 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:46,465 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:37:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1506938106, now seen corresponding path program 1 times [2018-01-21 08:37:46,465 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:46,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:46,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,466 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:46,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:46,531 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 08:37:46,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:46,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:37:46,532 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:46,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:37:46,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:37:46,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:37:46,533 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-21 08:37:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:46,628 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-21 08:37:46,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:37:46,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-21 08:37:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:46,633 INFO L225 Difference]: With dead ends: 65 [2018-01-21 08:37:46,634 INFO L226 Difference]: Without dead ends: 48 [2018-01-21 08:37:46,634 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:37:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-21 08:37:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-01-21 08:37:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 08:37:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-21 08:37:46,641 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-01-21 08:37:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:46,642 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-21 08:37:46,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:37:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-21 08:37:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 08:37:46,643 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:46,643 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:46,643 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:37:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1981787469, now seen corresponding path program 1 times [2018-01-21 08:37:46,644 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:46,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:46,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,645 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:46,707 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:37:46,718 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:46,725 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:46,728 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:46,728 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:46,744 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:37:46,744 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:37:46,744 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:37:46,744 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:37:46,744 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:37:46,744 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:37:46,745 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:37:46,745 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 08:37:46,745 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:37:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 08:37:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 08:37:46,747 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:46,747 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:46,747 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 08:37:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1942190490, now seen corresponding path program 1 times [2018-01-21 08:37:46,748 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:46,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:46,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,749 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:46,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:46,767 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 08:37:46,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:46,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:37:46,767 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:46,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:37:46,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:37:46,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:37:46,768 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 08:37:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:46,773 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 08:37:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:37:46,773 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 08:37:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:46,774 INFO L225 Difference]: With dead ends: 77 [2018-01-21 08:37:46,774 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 08:37:46,774 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 08:37:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 08:37:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-21 08:37:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 08:37:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-21 08:37:46,779 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2018-01-21 08:37:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:46,779 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-21 08:37:46,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:37:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-21 08:37:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 08:37:46,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:46,780 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:46,780 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 08:37:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash -215440820, now seen corresponding path program 1 times [2018-01-21 08:37:46,781 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:46,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:46,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:46,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:46,868 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 08:37:46,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:46,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:37:46,869 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:46,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:37:46,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:37:46,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:37:46,870 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-21 08:37:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:46,921 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 08:37:46,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 08:37:46,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-21 08:37:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:46,923 INFO L225 Difference]: With dead ends: 41 [2018-01-21 08:37:46,923 INFO L226 Difference]: Without dead ends: 36 [2018-01-21 08:37:46,924 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-21 08:37:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-21 08:37:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-21 08:37:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-21 08:37:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-21 08:37:46,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2018-01-21 08:37:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:46,930 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-21 08:37:46,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:37:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-21 08:37:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 08:37:46,931 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:46,931 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:46,931 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 08:37:46,932 INFO L82 PathProgramCache]: Analyzing trace with hash -211623728, now seen corresponding path program 1 times [2018-01-21 08:37:46,932 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:46,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:46,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:46,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:46,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:47,004 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 08:37:47,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:47,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:37:47,005 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:47,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:37:47,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:37:47,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:37:47,006 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-21 08:37:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:47,094 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-21 08:37:47,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:37:47,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-21 08:37:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:47,096 INFO L225 Difference]: With dead ends: 61 [2018-01-21 08:37:47,096 INFO L226 Difference]: Without dead ends: 46 [2018-01-21 08:37:47,096 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:37:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-21 08:37:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-01-21 08:37:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 08:37:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-21 08:37:47,102 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-01-21 08:37:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:47,102 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-21 08:37:47,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:37:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-21 08:37:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 08:37:47,103 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:47,103 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] [2018-01-21 08:37:47,103 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 08:37:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1396474071, now seen corresponding path program 1 times [2018-01-21 08:37:47,104 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:47,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:47,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:47,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:47,105 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:47,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 08:37:47,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:47,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 08:37:47,594 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:47,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 08:37:47,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 08:37:47,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-21 08:37:47,595 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 9 states. [2018-01-21 08:37:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:47,879 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-01-21 08:37:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 08:37:47,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-21 08:37:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:47,879 INFO L225 Difference]: With dead ends: 38 [2018-01-21 08:37:47,880 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:37:47,880 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-21 08:37:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:37:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:37:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:37:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:37:47,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-21 08:37:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:47,882 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:37:47,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 08:37:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:37:47,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:37:47,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 08:37:47 BoogieIcfgContainer [2018-01-21 08:37:47,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 08:37:47,885 INFO L168 Benchmark]: Toolchain (without parser) took 2745.90 ms. Allocated memory was 308.8 MB in the beginning and 487.6 MB in the end (delta: 178.8 MB). Free memory was 267.1 MB in the beginning and 400.4 MB in the end (delta: -133.2 MB). Peak memory consumption was 45.5 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:47,886 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:37:47,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.89 ms. Allocated memory is still 308.8 MB. Free memory was 266.1 MB in the beginning and 256.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:47,887 INFO L168 Benchmark]: Boogie Preprocessor took 40.67 ms. Allocated memory is still 308.8 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:47,887 INFO L168 Benchmark]: RCFGBuilder took 260.86 ms. Allocated memory is still 308.8 MB. Free memory was 254.1 MB in the beginning and 237.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:47,887 INFO L168 Benchmark]: TraceAbstraction took 2221.16 ms. Allocated memory was 308.8 MB in the beginning and 487.6 MB in the end (delta: 178.8 MB). Free memory was 237.5 MB in the beginning and 400.4 MB in the end (delta: -162.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:47,889 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.16 ms. Allocated memory is still 308.8 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.89 ms. Allocated memory is still 308.8 MB. Free memory was 266.1 MB in the beginning and 256.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.67 ms. Allocated memory is still 308.8 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 260.86 ms. Allocated memory is still 308.8 MB. Free memory was 254.1 MB in the beginning and 237.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2221.16 ms. Allocated memory was 308.8 MB in the beginning and 487.6 MB in the end (delta: 178.8 MB). Free memory was 237.5 MB in the beginning and 400.4 MB in the end (delta: -162.9 MB). Peak memory consumption was 15.9 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 Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=4, \old(a)=7, \old(b)=3, \old(b)=2, \old(n)=5, a={0:0}, b={0:0}, n=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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 - PositiveResult [Line: 622]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: fooErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 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=44occurred 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, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L636] a = malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc (n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L639] CALL foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[n - 2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, b[n - 2]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L643] FCALL free(b-1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L644] return 0; VAL [a={7:0}, b={13:4}, n=1] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 74 SDslu, 114 SDs, 0 SdLazy, 67 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 4688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. SAFE Result, 1.1s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 97 SDslu, 149 SDs, 0 SdLazy, 239 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 14824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_08-37-47-899.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_08-37-47-899.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_08-37-47-899.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_08-37-47-899.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_08-37-47-899.csv Received shutdown request...