java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:38:49,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:38:49,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:38:49,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:38:49,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:38:49,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:38:49,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:38:49,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:38:49,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:38:49,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:38:49,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:38:49,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:38:49,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:38:49,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:38:49,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:38:49,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:38:49,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:38:49,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:38:49,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:38:49,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:38:49,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:38:49,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:38:49,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:38:49,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:38:49,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:38:49,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:38:49,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:38:49,905 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:38:49,905 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:38:49,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:38:49,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:38:49,906 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:38:49,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:38:49,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:38:49,917 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:38:49,917 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:38:49,917 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:38:49,918 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:38:49,918 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:38:49,918 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:38:49,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:38:49,919 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:38:49,919 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:38:49,919 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:38:49,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:38:49,919 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:38:49,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:38:49,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:38:49,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:38:49,920 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:38:49,920 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:38:49,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:38:49,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:38:49,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:38:49,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:38:49,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:38:49,921 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:38:49,922 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:38:49,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:38:49,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:38:49,922 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:38:49,922 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:38:49,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:38:49,923 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:38:49,923 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:38:49,923 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:38:49,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:38:49,923 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:38:49,924 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:38:49,924 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:38:49,925 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:38:49,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:38:49,970 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:38:49,974 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:38:49,976 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:38:49,976 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:38:49,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-01-21 00:38:50,148 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:38:50,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:38:50,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:38:50,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:38:50,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:38:50,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408feb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50, skipping insertion in model container [2018-01-21 00:38:50,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,177 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:38:50,218 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:38:50,345 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:38:50,373 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:38:50,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50 WrapperNode [2018-01-21 00:38:50,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:38:50,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:38:50,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:38:50,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:38:50,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (1/1) ... [2018-01-21 00:38:50,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:38:50,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:38:50,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:38:50,428 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:38:50,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:38:50,481 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:38:50,482 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:38:50,482 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:38:50,482 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:38:50,482 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:38:50,482 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:38:50,482 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:38:50,483 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:38:50,483 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:38:50,483 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:38:50,483 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:38:50,483 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:38:50,483 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:38:50,483 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:38:50,926 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:38:50,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:38:50 BoogieIcfgContainer [2018-01-21 00:38:50,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:38:50,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:38:50,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:38:50,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:38:50,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:38:50" (1/3) ... [2018-01-21 00:38:50,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333ea925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:38:50, skipping insertion in model container [2018-01-21 00:38:50,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:50" (2/3) ... [2018-01-21 00:38:50,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333ea925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:38:50, skipping insertion in model container [2018-01-21 00:38:50,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:38:50" (3/3) ... [2018-01-21 00:38:50,934 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-01-21 00:38:50,941 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:38:50,947 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:38:50,994 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:50,995 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:50,995 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:50,995 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:50,995 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:50,995 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:50,996 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:50,996 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:38:50,997 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-21 00:38:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:38:51,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:51,028 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:38:51,028 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:38:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash 262355, now seen corresponding path program 1 times [2018-01-21 00:38:51,036 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:51,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:51,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:51,163 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:38:51,170 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:51,179 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:51,179 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:51,180 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:51,180 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:51,180 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:51,180 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:51,180 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:51,180 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:38:51,180 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-21 00:38:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:38:51,186 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:51,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] [2018-01-21 00:38:51,187 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash -936424552, now seen corresponding path program 1 times [2018-01-21 00:38:51,187 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:51,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:51,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,189 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:51,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:51,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:51,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:51,360 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:51,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:38:51,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:38:51,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:51,375 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 2 states. [2018-01-21 00:38:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:51,406 INFO L93 Difference]: Finished difference Result 216 states and 260 transitions. [2018-01-21 00:38:51,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:38:51,408 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 00:38:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:51,418 INFO L225 Difference]: With dead ends: 216 [2018-01-21 00:38:51,418 INFO L226 Difference]: Without dead ends: 119 [2018-01-21 00:38:51,420 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-21 00:38:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-21 00:38:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-21 00:38:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-01-21 00:38:51,459 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 22 [2018-01-21 00:38:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:51,460 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-01-21 00:38:51,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:38:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-01-21 00:38:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:38:51,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:51,462 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 00:38:51,462 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1072713404, now seen corresponding path program 1 times [2018-01-21 00:38:51,462 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:51,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:51,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,464 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:51,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:51,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:51,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:38:51,568 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:51,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:38:51,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:38:51,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:38:51,569 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 4 states. [2018-01-21 00:38:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:51,628 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-01-21 00:38:51,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:38:51,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-21 00:38:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:51,631 INFO L225 Difference]: With dead ends: 161 [2018-01-21 00:38:51,631 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 00:38:51,633 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 00:38:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-21 00:38:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-21 00:38:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2018-01-21 00:38:51,647 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 27 [2018-01-21 00:38:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:51,647 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2018-01-21 00:38:51,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:38:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2018-01-21 00:38:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 00:38:51,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:51,649 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:51,649 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1759311448, now seen corresponding path program 1 times [2018-01-21 00:38:51,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:51,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:51,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,651 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:51,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:51,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:51,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:38:51,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:51,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:38:51,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:38:51,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:51,720 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand 3 states. [2018-01-21 00:38:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:51,735 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2018-01-21 00:38:51,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:38:51,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-21 00:38:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:51,737 INFO L225 Difference]: With dead ends: 237 [2018-01-21 00:38:51,737 INFO L226 Difference]: Without dead ends: 158 [2018-01-21 00:38:51,738 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-21 00:38:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-21 00:38:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-21 00:38:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-01-21 00:38:51,748 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 44 [2018-01-21 00:38:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:51,748 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-01-21 00:38:51,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:38:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-01-21 00:38:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 00:38:51,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:51,751 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:51,751 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash -512140811, now seen corresponding path program 1 times [2018-01-21 00:38:51,751 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:51,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:51,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,753 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:51,821 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:38:51,831 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:51,839 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:51,840 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:51,858 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:51,858 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:51,858 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:51,858 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:51,859 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:51,859 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:51,859 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:51,859 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:38:51,859 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-21 00:38:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:38:51,862 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:51,862 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] [2018-01-21 00:38:51,862 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash -769688664, now seen corresponding path program 1 times [2018-01-21 00:38:51,863 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:51,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:51,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,864 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:51,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:51,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:51,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:51,885 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:51,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:38:51,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:38:51,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:51,885 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 2 states. [2018-01-21 00:38:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:51,892 INFO L93 Difference]: Finished difference Result 216 states and 260 transitions. [2018-01-21 00:38:51,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:38:51,892 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 00:38:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:51,894 INFO L225 Difference]: With dead ends: 216 [2018-01-21 00:38:51,894 INFO L226 Difference]: Without dead ends: 117 [2018-01-21 00:38:51,895 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-21 00:38:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-21 00:38:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-21 00:38:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-21 00:38:51,903 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 20 [2018-01-21 00:38:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:51,904 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-21 00:38:51,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:38:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-21 00:38:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:38:51,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:51,905 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:51,905 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -403350444, now seen corresponding path program 1 times [2018-01-21 00:38:51,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:51,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:51,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:51,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:51,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:51,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:51,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:38:51,960 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:51,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:38:51,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:38:51,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:38:51,961 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 4 states. [2018-01-21 00:38:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:52,015 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-01-21 00:38:52,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:38:52,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-21 00:38:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:52,017 INFO L225 Difference]: With dead ends: 157 [2018-01-21 00:38:52,017 INFO L226 Difference]: Without dead ends: 154 [2018-01-21 00:38:52,017 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-21 00:38:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-21 00:38:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-21 00:38:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-01-21 00:38:52,026 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 25 [2018-01-21 00:38:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:52,026 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-01-21 00:38:52,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:38:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-01-21 00:38:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:38:52,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:52,028 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:52,029 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1941493352, now seen corresponding path program 1 times [2018-01-21 00:38:52,029 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:52,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:52,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:52,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:52,030 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:52,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:52,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:52,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:38:52,085 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:52,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:38:52,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:38:52,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:52,085 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 3 states. [2018-01-21 00:38:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:52,096 INFO L93 Difference]: Finished difference Result 233 states and 269 transitions. [2018-01-21 00:38:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:38:52,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-01-21 00:38:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:52,098 INFO L225 Difference]: With dead ends: 233 [2018-01-21 00:38:52,098 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 00:38:52,099 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 00:38:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-21 00:38:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-21 00:38:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2018-01-21 00:38:52,107 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 42 [2018-01-21 00:38:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:52,107 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2018-01-21 00:38:52,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:38:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2018-01-21 00:38:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 00:38:52,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:52,109 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:52,109 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1818459461, now seen corresponding path program 1 times [2018-01-21 00:38:52,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:52,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:52,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:52,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:52,111 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:52,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:52,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:52,694 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:52,695 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-21 00:38:52,697 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [20], [22], [25], [42], [44], [47], [153], [157], [159], [163], [165], [166], [171], [172], [173], [177], [207], [211], [213], [214], [215], [218], [232], [233], [234], [235], [239], [241], [242], [243], [244] [2018-01-21 00:38:52,754 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:38:52,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:38:53,073 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 00:38:53,076 INFO L168 Benchmark]: Toolchain (without parser) took 2927.89 ms. Allocated memory was 302.0 MB in the beginning and 480.2 MB in the end (delta: 178.3 MB). Free memory was 260.3 MB in the beginning and 312.4 MB in the end (delta: -52.1 MB). Peak memory consumption was 126.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:53,077 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:38:53,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.32 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 248.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:53,078 INFO L168 Benchmark]: Boogie Preprocessor took 40.83 ms. Allocated memory is still 302.0 MB. Free memory was 248.2 MB in the beginning and 245.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:53,078 INFO L168 Benchmark]: RCFGBuilder took 499.60 ms. Allocated memory is still 302.0 MB. Free memory was 245.2 MB in the beginning and 210.6 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:53,078 INFO L168 Benchmark]: TraceAbstraction took 2147.33 ms. Allocated memory was 302.0 MB in the beginning and 480.2 MB in the end (delta: 178.3 MB). Free memory was 210.6 MB in the beginning and 312.4 MB in the end (delta: -101.8 MB). Peak memory consumption was 76.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:53,080 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.19 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.32 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 248.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.83 ms. Allocated memory is still 302.0 MB. Free memory was 248.2 MB in the beginning and 245.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 499.60 ms. Allocated memory is still 302.0 MB. Free memory was 245.2 MB in the beginning and 210.6 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2147.33 ms. Allocated memory was 302.0 MB in the beginning and 480.2 MB in the end (delta: 178.3 MB). Free memory was 210.6 MB in the beginning and 312.4 MB in the end (delta: -101.8 MB). Peak memory consumption was 76.4 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, 122 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=122occurred 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) VAL [malloc(sizeof(*tree))={14:0}] [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; VAL [malloc(sizeof(*tree))={14:0}, tree={14:0}] [L635] FCALL tree->left = ((void *)0) VAL [malloc(sizeof(*tree))={14:0}, tree={14:0}] [L636] FCALL tree->right = ((void *)0) VAL [malloc(sizeof(*tree))={14:0}, tree={14:0}] [L637] EXPR, FCALL malloc(sizeof(ListNode)) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}] [L637] FCALL tree->list = malloc(sizeof(ListNode)) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}] [L638] EXPR, FCALL tree->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}, tree->list={16:0}] [L638] EXPR, FCALL tree->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}, tree->list={16:0}, tree->list={16:0}] [L638] FCALL tree->list->next = tree->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}, tree->list={16:0}, tree->list={16:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tree={14:0}] [L689] EXPR, FCALL tmp->left VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->left={0:0}, tree={14:0}] [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) VAL [(((void *)0) != tmp->left) || (((void *)0) != tmp->right)=0, malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->left={0:0}, tree={14:0}] [L689] EXPR, FCALL tmp->right VAL [(((void *)0) != tmp->left) || (((void *)0) != tmp->right)=0, malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->left={0:0}, tmp->right={0:0}, tree={14:0}] [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) VAL [(((void *)0) != tmp->left) || (((void *)0) != tmp->right)=0, malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->left={0:0}, tmp->right={0:0}, tree={14:0}] [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tree={0:0}] [L716] EXPR, FCALL tmp->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tree={0:0}] [L716] EXPR, FCALL tmp->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tmp->list={16:0}, tree={0:0}] [L716] EXPR, FCALL tmp->list->next VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tmp->list={16:0}, tmp->list->next={16:0}, tree={0:0}] [L716] COND FALSE !(tmp->list != tmp->list->next) [L722] EXPR, FCALL tmp->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tree={0:0}] [L722] FCALL free(tmp->list) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tree={0:0}] [L723] FCALL free(tmp) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tree={0:0}] [L685] COND FALSE !(((void *)0) != tree) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tree={0:0}] [L725] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 122 locations, 3 error locations. UNSAFE Result, 0.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 259 SDslu, 187 SDs, 0 SdLazy, 21 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 4292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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/tree_of_cslls_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-38-53-087.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-38-53-087.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-38-53-087.csv Received shutdown request...