java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:03:51,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:03:51,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:03:51,891 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:03:51,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:03:51,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:03:51,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:03:51,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:03:51,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:03:51,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:03:51,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:03:51,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:03:51,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:03:51,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:03:51,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:03:51,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:03:51,926 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:03:51,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:03:51,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:03:51,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:03:51,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:03:51,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:03:51,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:03:51,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:03:51,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:03:51,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:03:51,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:03:51,936 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:03:51,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:03:51,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:03:51,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:03:51,937 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 01:03:51,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:03:51,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:03:51,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:03:51,948 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:03:51,948 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:03:51,948 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:03:51,948 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:03:51,949 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:03:51,949 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:03:51,949 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:03:51,950 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:03:51,950 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:03:51,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:03:51,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:03:51,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:03:51,950 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:03:51,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:03:51,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:03:51,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:03:51,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:03:51,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:03:51,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:03:51,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:03:51,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:03:51,952 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:03:51,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:03:51,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:03:51,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:03:51,953 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:03:51,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:03:51,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:03:51,953 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:03:51,953 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:03:51,954 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:03:51,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:03:51,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:03:51,954 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:03:51,955 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:03:51,955 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:03:51,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:03:52,000 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:03:52,004 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:03:52,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:03:52,006 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:03:52,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:03:52,170 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:03:52,175 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:03:52,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:03:52,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:03:52,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:03:52,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b83b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52, skipping insertion in model container [2018-01-21 01:03:52,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,202 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:03:52,245 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:03:52,363 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:03:52,390 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:03:52,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52 WrapperNode [2018-01-21 01:03:52,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:03:52,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:03:52,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:03:52,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:03:52,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (1/1) ... [2018-01-21 01:03:52,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:03:52,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:03:52,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:03:52,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:03:52,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:03:52,489 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:03:52,489 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:03:52,489 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:03:52,489 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:03:52,489 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:03:52,489 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:03:52,489 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:03:52,489 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:03:52,489 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:03:52,490 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:03:52,490 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:03:52,490 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:03:52,490 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:03:52,490 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:03:52,490 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:03:52,914 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:03:52,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:03:52 BoogieIcfgContainer [2018-01-21 01:03:52,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:03:52,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:03:52,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:03:52,917 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:03:52,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:03:52" (1/3) ... [2018-01-21 01:03:52,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0519c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:03:52, skipping insertion in model container [2018-01-21 01:03:52,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:52" (2/3) ... [2018-01-21 01:03:52,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0519c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:03:52, skipping insertion in model container [2018-01-21 01:03:52,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:03:52" (3/3) ... [2018-01-21 01:03:52,920 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:03:52,927 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:03:52,933 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:03:52,984 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:03:52,984 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:03:52,985 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:03:52,985 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:03:52,985 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:03:52,985 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:03:52,985 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:03:52,985 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:03:52,986 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:03:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-21 01:03:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:03:53,009 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:53,010 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:03:53,010 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:03:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash 393051, now seen corresponding path program 1 times [2018-01-21 01:03:53,016 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:53,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:53,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:53,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:53,057 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:03:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:03:53,107 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:03:53,113 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:03:53,121 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:03:53,121 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:03:53,121 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:03:53,121 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:03:53,121 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:03:53,121 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:03:53,122 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:03:53,122 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:03:53,122 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:03:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-21 01:03:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 01:03:53,128 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:53,128 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] [2018-01-21 01:03:53,128 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash -232031712, now seen corresponding path program 1 times [2018-01-21 01:03:53,129 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:53,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:53,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:53,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:53,130 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:53,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:03:53,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:53,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:03:53,187 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:53,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:03:53,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:03:53,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:03:53,292 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2018-01-21 01:03:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:53,326 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2018-01-21 01:03:53,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:03:53,327 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-21 01:03:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:53,338 INFO L225 Difference]: With dead ends: 237 [2018-01-21 01:03:53,338 INFO L226 Difference]: Without dead ends: 120 [2018-01-21 01:03:53,341 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:03:53,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-21 01:03:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-21 01:03:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-21 01:03:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2018-01-21 01:03:53,382 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 23 [2018-01-21 01:03:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:53,382 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2018-01-21 01:03:53,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:03:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2018-01-21 01:03:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 01:03:53,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:53,384 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:03:53,385 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:53,385 INFO L82 PathProgramCache]: Analyzing trace with hash -448715966, now seen corresponding path program 1 times [2018-01-21 01:03:53,385 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:53,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:53,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:53,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:53,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:53,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:03:53,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:53,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:03:53,572 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:53,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:03:53,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:03:53,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:03:53,575 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 5 states. [2018-01-21 01:03:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:53,803 INFO L93 Difference]: Finished difference Result 280 states and 303 transitions. [2018-01-21 01:03:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 01:03:53,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-21 01:03:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:53,807 INFO L225 Difference]: With dead ends: 280 [2018-01-21 01:03:53,808 INFO L226 Difference]: Without dead ends: 188 [2018-01-21 01:03:53,809 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:03:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-21 01:03:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 124. [2018-01-21 01:03:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-21 01:03:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-01-21 01:03:53,817 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 36 [2018-01-21 01:03:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:53,817 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-01-21 01:03:53,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:03:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-01-21 01:03:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 01:03:53,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:53,819 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:03:53,819 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1412768891, now seen corresponding path program 1 times [2018-01-21 01:03:53,819 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:53,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:53,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:53,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:53,820 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:53,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:03:53,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:53,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:03:53,890 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:53,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:03:53,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:03:53,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:03:53,891 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-01-21 01:03:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:53,988 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2018-01-21 01:03:53,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:03:53,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-21 01:03:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:53,991 INFO L225 Difference]: With dead ends: 206 [2018-01-21 01:03:53,991 INFO L226 Difference]: Without dead ends: 179 [2018-01-21 01:03:53,992 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:03:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-21 01:03:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 128. [2018-01-21 01:03:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-21 01:03:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-21 01:03:54,003 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 38 [2018-01-21 01:03:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:54,003 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-21 01:03:54,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:03:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-21 01:03:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-21 01:03:54,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:54,006 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:03:54,006 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -812324167, now seen corresponding path program 1 times [2018-01-21 01:03:54,007 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:54,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:54,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,008 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:03:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:03:54,066 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:03:54,077 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:03:54,087 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:03:54,088 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:03:54,106 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:03:54,107 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:03:54,107 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:03:54,107 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:03:54,107 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:03:54,107 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:03:54,107 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:03:54,107 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:03:54,107 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:03:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-21 01:03:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 01:03:54,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:54,111 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:03:54,111 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:03:54,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1381245512, now seen corresponding path program 1 times [2018-01-21 01:03:54,111 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:54,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:54,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:54,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:03:54,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:54,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:03:54,127 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:54,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:03:54,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:03:54,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:03:54,128 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2018-01-21 01:03:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:54,134 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2018-01-21 01:03:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:03:54,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 01:03:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:54,136 INFO L225 Difference]: With dead ends: 237 [2018-01-21 01:03:54,136 INFO L226 Difference]: Without dead ends: 118 [2018-01-21 01:03:54,137 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:03:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-21 01:03:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-21 01:03:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-21 01:03:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-01-21 01:03:54,145 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 21 [2018-01-21 01:03:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:54,145 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-01-21 01:03:54,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:03:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-01-21 01:03:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 01:03:54,147 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:54,147 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:03:54,147 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:03:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1359124646, now seen corresponding path program 1 times [2018-01-21 01:03:54,147 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:54,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:54,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:54,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:03:54,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:54,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:03:54,219 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:54,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:03:54,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:03:54,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:03:54,220 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 5 states. [2018-01-21 01:03:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:54,367 INFO L93 Difference]: Finished difference Result 276 states and 298 transitions. [2018-01-21 01:03:54,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 01:03:54,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-21 01:03:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:54,370 INFO L225 Difference]: With dead ends: 276 [2018-01-21 01:03:54,370 INFO L226 Difference]: Without dead ends: 186 [2018-01-21 01:03:54,371 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:03:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-21 01:03:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 122. [2018-01-21 01:03:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-21 01:03:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-21 01:03:54,384 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 34 [2018-01-21 01:03:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:54,384 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-21 01:03:54,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:03:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-21 01:03:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 01:03:54,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:54,386 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:03:54,386 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 01:03:54,387 INFO L82 PathProgramCache]: Analyzing trace with hash -166833059, now seen corresponding path program 1 times [2018-01-21 01:03:54,387 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:54,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:54,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,388 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:54,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:03:54,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:54,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:03:54,438 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:54,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:03:54,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:03:54,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:03:54,439 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 5 states. [2018-01-21 01:03:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:54,617 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2018-01-21 01:03:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:03:54,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-21 01:03:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:54,619 INFO L225 Difference]: With dead ends: 202 [2018-01-21 01:03:54,620 INFO L226 Difference]: Without dead ends: 177 [2018-01-21 01:03:54,620 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:03:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-21 01:03:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2018-01-21 01:03:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-21 01:03:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-21 01:03:54,628 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 36 [2018-01-21 01:03:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:54,629 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-21 01:03:54,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:03:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-21 01:03:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-21 01:03:54,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:54,631 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, 1, 1, 1, 1, 1] [2018-01-21 01:03:54,632 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 01:03:54,632 INFO L82 PathProgramCache]: Analyzing trace with hash -742743919, now seen corresponding path program 1 times [2018-01-21 01:03:54,633 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:54,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:54,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:54,634 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:54,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:03:54,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:03:54,779 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:03:54,780 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-21 01:03:54,781 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [13], [18], [22], [28], [31], [32], [46], [47], [48], [53], [54], [55], [61], [65], [71], [75], [77], [80], [169], [173], [178], [182], [190], [194], [196], [197], [198], [202], [206], [275], [280], [284], [290], [291], [297], [301], [303], [304], [305], [366], [368], [369], [370], [371], [375], [377], [378], [379], [380] [2018-01-21 01:03:54,827 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:03:54,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:03:55,191 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 01:03:55,194 INFO L168 Benchmark]: Toolchain (without parser) took 3023.97 ms. Allocated memory was 304.1 MB in the beginning and 478.2 MB in the end (delta: 174.1 MB). Free memory was 261.4 MB in the beginning and 320.9 MB in the end (delta: -59.5 MB). Peak memory consumption was 114.6 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:55,196 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:03:55,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.18 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 249.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:55,197 INFO L168 Benchmark]: Boogie Preprocessor took 39.28 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 245.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:55,197 INFO L168 Benchmark]: RCFGBuilder took 475.14 ms. Allocated memory is still 304.1 MB. Free memory was 245.5 MB in the beginning and 214.9 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:55,197 INFO L168 Benchmark]: TraceAbstraction took 2278.03 ms. Allocated memory was 304.1 MB in the beginning and 478.2 MB in the end (delta: 174.1 MB). Free memory was 212.9 MB in the beginning and 320.9 MB in the end (delta: -107.9 MB). Peak memory consumption was 66.1 MB. Max. memory is 5.3 GB. [2018-01-21 01:03:55,199 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.18 ms. Allocated memory is still 304.1 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.18 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 249.4 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.28 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 245.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 475.14 ms. Allocated memory is still 304.1 MB. Free memory was 245.5 MB in the beginning and 214.9 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2278.03 ms. Allocated memory was 304.1 MB in the beginning and 478.2 MB in the end (delta: 174.1 MB). Free memory was 212.9 MB in the beginning and 320.9 MB in the end (delta: -107.9 MB). Peak memory consumption was 66.1 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) * 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, 123 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=123occurred 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: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={10:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] FCALL list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND TRUE __VERIFIER_nondet_int() [L993] FCALL list->inner = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR, FCALL end->inner VAL [end={10:0}, end->inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND FALSE !(((void*)0) != inner) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1029] COND FALSE !(!(len <= 1)) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1029] COND FALSE !(0) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] end = end->next [L1014] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1035] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1037] EXPR, FCALL list->inner VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L1037] end = list->inner [L1039] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1047] EXPR, FCALL list->next VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->next={0:0}, malloc(sizeof(SLL))={10:0}] [L1047] end = list->next [L1048] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1049] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1035] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1052] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 123 locations, 3 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 350 SDtfs, 417 SDslu, 428 SDs, 0 SdLazy, 161 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=3, 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, 115 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 7469 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 - 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/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-03-55-207.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-03-55-207.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-03-55-207.csv Received shutdown request...