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/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:42:45,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:42:45,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:42:45,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:42:45,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:42:45,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:42:45,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:42:45,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:42:45,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:42:45,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:42:45,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:42:45,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:42:45,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:42:45,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:42:45,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:42:45,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:42:45,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:42:45,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:42:45,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:42:45,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:42:45,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:42:45,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:42:45,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:42:45,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:42:45,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:42:45,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:42:45,905 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:42:45,906 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:42:45,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:42:45,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:42:45,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:42:45,907 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:42:45,918 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:42:45,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:42:45,919 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:42:45,919 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:42:45,919 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:42:45,919 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:42:45,920 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:42:45,920 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:42:45,921 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:42:45,921 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:42:45,921 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:42:45,921 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:42:45,921 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:42:45,921 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:42:45,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:42:45,922 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:42:45,922 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:42:45,922 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:42:45,922 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:42:45,923 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:42:45,923 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:42:45,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:42:45,923 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:42:45,923 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:42:45,924 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:42:45,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:42:45,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:42:45,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:42:45,924 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:42:45,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:42:45,925 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:42:45,925 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:42:45,925 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:42:45,925 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:42:45,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:42:45,926 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:42:45,926 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:42:45,927 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:42:45,927 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:42:45,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:42:45,976 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:42:45,981 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:42:45,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:42:45,983 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:42:45,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-01-21 00:42:46,177 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:42:46,183 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:42:46,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:46,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:42:46,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:42:46,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41741684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46, skipping insertion in model container [2018-01-21 00:42:46,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,212 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:46,249 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:46,364 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:46,383 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:46,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46 WrapperNode [2018-01-21 00:42:46,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:46,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:42:46,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:42:46,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:42:46,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (1/1) ... [2018-01-21 00:42:46,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:42:46,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:42:46,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:42:46,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:42:46,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (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:42:46,477 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:42:46,477 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:42:46,477 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:42:46,478 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:42:46,478 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:42:46,478 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:42:46,478 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:42:46,478 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:42:46,478 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:42:46,479 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:42:46,479 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:42:46,479 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:42:46,479 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 00:42:46,479 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:42:46,479 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:42:46,480 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:42:46,480 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:42:46,854 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:42:46,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:46 BoogieIcfgContainer [2018-01-21 00:42:46,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:42:46,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:42:46,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:42:46,857 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:42:46,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:42:46" (1/3) ... [2018-01-21 00:42:46,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532eec50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:46, skipping insertion in model container [2018-01-21 00:42:46,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:46" (2/3) ... [2018-01-21 00:42:46,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532eec50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:46, skipping insertion in model container [2018-01-21 00:42:46,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:46" (3/3) ... [2018-01-21 00:42:46,860 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-01-21 00:42:46,866 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:42:46,872 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:42:46,914 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:46,914 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:46,914 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:46,914 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:46,915 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:46,915 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:46,915 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:46,915 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:42:46,916 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 00:42:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:42:46,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:46,945 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:42:46,945 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:42:46,948 INFO L82 PathProgramCache]: Analyzing trace with hash 217246, now seen corresponding path program 1 times [2018-01-21 00:42:46,950 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:46,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:46,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:46,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:46,996 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:47,053 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:47,060 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:47,066 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:47,066 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:47,066 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:47,066 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:47,066 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:47,066 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:47,066 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:47,067 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:42:47,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 00:42:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 00:42:47,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:47,071 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:47,071 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:47,071 INFO L82 PathProgramCache]: Analyzing trace with hash 843511722, now seen corresponding path program 1 times [2018-01-21 00:42:47,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:47,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:47,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:47,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:47,123 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:42:47,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:47,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:47,125 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:47,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:47,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:47,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:47,223 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-01-21 00:42:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:47,252 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2018-01-21 00:42:47,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:47,254 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-21 00:42:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:47,267 INFO L225 Difference]: With dead ends: 175 [2018-01-21 00:42:47,267 INFO L226 Difference]: Without dead ends: 88 [2018-01-21 00:42:47,271 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:42:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-21 00:42:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-21 00:42:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-21 00:42:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2018-01-21 00:42:47,308 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 11 [2018-01-21 00:42:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:47,309 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2018-01-21 00:42:47,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2018-01-21 00:42:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 00:42:47,309 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:47,309 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:47,310 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -578790635, now seen corresponding path program 1 times [2018-01-21 00:42:47,310 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:47,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:47,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,311 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:47,342 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:47,346 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:47,347 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:47,348 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:47,354 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:47,354 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:47,354 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:47,355 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:47,355 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:47,355 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:47,355 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:47,355 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:42:47,355 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 00:42:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-21 00:42:47,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:47,358 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:47,358 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1681322799, now seen corresponding path program 1 times [2018-01-21 00:42:47,358 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:47,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:47,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,360 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:47,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:47,379 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:42:47,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:47,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:47,379 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:47,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:47,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:47,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:47,380 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-01-21 00:42:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:47,390 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2018-01-21 00:42:47,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:47,391 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-21 00:42:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:47,392 INFO L225 Difference]: With dead ends: 175 [2018-01-21 00:42:47,392 INFO L226 Difference]: Without dead ends: 86 [2018-01-21 00:42:47,393 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:42:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-21 00:42:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-21 00:42:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-21 00:42:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2018-01-21 00:42:47,402 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 9 [2018-01-21 00:42:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:47,403 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2018-01-21 00:42:47,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2018-01-21 00:42:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-21 00:42:47,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:47,404 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:47,404 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1430768294, now seen corresponding path program 1 times [2018-01-21 00:42:47,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:47,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:47,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,406 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:47,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:47,453 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:42:47,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:47,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:47,453 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:47,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:42:47,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:42:47,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:47,455 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 3 states. [2018-01-21 00:42:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:47,500 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2018-01-21 00:42:47,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:42:47,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-21 00:42:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:47,503 INFO L225 Difference]: With dead ends: 111 [2018-01-21 00:42:47,503 INFO L226 Difference]: Without dead ends: 109 [2018-01-21 00:42:47,504 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-21 00:42:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2018-01-21 00:42:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-21 00:42:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-01-21 00:42:47,511 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 12 [2018-01-21 00:42:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:47,511 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-01-21 00:42:47,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:42:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-01-21 00:42:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 00:42:47,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:47,512 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 00:42:47,512 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1220894246, now seen corresponding path program 1 times [2018-01-21 00:42:47,513 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:47,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:47,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:47,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:47,574 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:42:47,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:47,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:42:47,575 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:47,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:42:47,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:42:47,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:47,575 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 3 states. [2018-01-21 00:42:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:47,631 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2018-01-21 00:42:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:42:47,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-21 00:42:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:47,633 INFO L225 Difference]: With dead ends: 186 [2018-01-21 00:42:47,633 INFO L226 Difference]: Without dead ends: 105 [2018-01-21 00:42:47,634 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:42:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-21 00:42:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-01-21 00:42:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 00:42:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2018-01-21 00:42:47,643 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 21 [2018-01-21 00:42:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:47,643 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2018-01-21 00:42:47,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:42:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2018-01-21 00:42:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 00:42:47,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:47,644 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:47,645 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash 354796251, now seen corresponding path program 1 times [2018-01-21 00:42:47,645 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:47,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:47,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,646 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:47,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:47,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:47,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:42:47,744 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:47,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:42:47,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:42:47,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:42:47,745 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 5 states. [2018-01-21 00:42:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:47,840 INFO L93 Difference]: Finished difference Result 265 states and 312 transitions. [2018-01-21 00:42:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:42:47,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-21 00:42:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:47,842 INFO L225 Difference]: With dead ends: 265 [2018-01-21 00:42:47,843 INFO L226 Difference]: Without dead ends: 182 [2018-01-21 00:42:47,844 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:42:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-21 00:42:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 103. [2018-01-21 00:42:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 00:42:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-01-21 00:42:47,854 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 30 [2018-01-21 00:42:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:47,855 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-01-21 00:42:47,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:42:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-01-21 00:42:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:42:47,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:47,856 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:47,856 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:47,856 INFO L82 PathProgramCache]: Analyzing trace with hash -626570212, now seen corresponding path program 1 times [2018-01-21 00:42:47,857 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:47,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:47,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:47,858 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:47,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:47,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:47,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:42:47,940 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:47,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:42:47,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:42:47,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:42:47,941 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 5 states. [2018-01-21 00:42:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:48,048 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2018-01-21 00:42:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 00:42:48,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-21 00:42:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:48,050 INFO L225 Difference]: With dead ends: 237 [2018-01-21 00:42:48,050 INFO L226 Difference]: Without dead ends: 157 [2018-01-21 00:42:48,051 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:42:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-21 00:42:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2018-01-21 00:42:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 00:42:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-01-21 00:42:48,060 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 31 [2018-01-21 00:42:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:48,061 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-01-21 00:42:48,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:42:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-01-21 00:42:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 00:42:48,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:48,063 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:48,063 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:48,063 INFO L82 PathProgramCache]: Analyzing trace with hash 85377444, now seen corresponding path program 1 times [2018-01-21 00:42:48,063 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:48,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:48,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:48,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:48,065 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:48,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:48,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:48,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:42:48,127 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:48,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:42:48,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:42:48,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:42:48,128 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 4 states. [2018-01-21 00:42:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:48,176 INFO L93 Difference]: Finished difference Result 262 states and 298 transitions. [2018-01-21 00:42:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:42:48,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-21 00:42:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:48,178 INFO L225 Difference]: With dead ends: 262 [2018-01-21 00:42:48,178 INFO L226 Difference]: Without dead ends: 175 [2018-01-21 00:42:48,179 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:42:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-21 00:42:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 104. [2018-01-21 00:42:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-21 00:42:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-01-21 00:42:48,189 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 40 [2018-01-21 00:42:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:48,189 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-01-21 00:42:48,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:42:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-01-21 00:42:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:42:48,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:48,191 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:48,191 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1217411263, now seen corresponding path program 1 times [2018-01-21 00:42:48,192 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:48,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:48,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:48,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:48,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:48,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:48,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:48,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-21 00:42:48,600 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:48,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 00:42:48,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 00:42:48,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:42:48,601 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 10 states. [2018-01-21 00:42:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:49,084 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-01-21 00:42:49,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 00:42:49,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-21 00:42:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:49,086 INFO L225 Difference]: With dead ends: 168 [2018-01-21 00:42:49,086 INFO L226 Difference]: Without dead ends: 165 [2018-01-21 00:42:49,087 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-01-21 00:42:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-21 00:42:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2018-01-21 00:42:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-21 00:42:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2018-01-21 00:42:49,095 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 42 [2018-01-21 00:42:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:49,096 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2018-01-21 00:42:49,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 00:42:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2018-01-21 00:42:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 00:42:49,098 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:49,098 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:49,099 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:49,099 INFO L82 PathProgramCache]: Analyzing trace with hash -456231378, now seen corresponding path program 1 times [2018-01-21 00:42:49,099 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:49,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:49,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:49,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:49,101 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:49,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:49,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:42:49,760 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:42:49,761 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-21 00:42:49,763 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [30], [36], [37], [43], [44], [48], [49], [58], [59], [60], [62], [63], [70], [74], [76], [79], [144], [145], [146], [150], [154], [156], [157], [158], [159], [160], [167], [174], [179], [181], [182], [183], [189], [190], [191] [2018-01-21 00:42:49,824 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:42:49,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:42:50,019 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:42:50,024 INFO L168 Benchmark]: Toolchain (without parser) took 3845.70 ms. Allocated memory was 309.3 MB in the beginning and 528.5 MB in the end (delta: 219.2 MB). Free memory was 267.7 MB in the beginning and 415.5 MB in the end (delta: -147.9 MB). Peak memory consumption was 71.3 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:50,026 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 309.3 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:42:50,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.04 ms. Allocated memory is still 309.3 MB. Free memory was 266.7 MB in the beginning and 255.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:50,026 INFO L168 Benchmark]: Boogie Preprocessor took 38.75 ms. Allocated memory is still 309.3 MB. Free memory was 255.6 MB in the beginning and 253.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:50,027 INFO L168 Benchmark]: RCFGBuilder took 424.83 ms. Allocated memory is still 309.3 MB. Free memory was 253.6 MB in the beginning and 224.9 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:50,027 INFO L168 Benchmark]: TraceAbstraction took 3167.53 ms. Allocated memory was 309.3 MB in the beginning and 528.5 MB in the end (delta: 219.2 MB). Free memory was 224.9 MB in the beginning and 415.5 MB in the end (delta: -190.6 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:50,029 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.27 ms. Allocated memory is still 309.3 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.04 ms. Allocated memory is still 309.3 MB. Free memory was 266.7 MB in the beginning and 255.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.75 ms. Allocated memory is still 309.3 MB. Free memory was 255.6 MB in the beginning and 253.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 424.83 ms. Allocated memory is still 309.3 MB. Free memory was 253.6 MB in the beginning and 224.9 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3167.53 ms. Allocated memory was 309.3 MB in the beginning and 528.5 MB in the end (delta: 219.2 MB). Free memory was 224.9 MB in the beginning and 415.5 MB in the end (delta: -190.6 MB). Peak memory consumption was 28.5 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, 91 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=91occurred 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: [L629] struct TLItem* data = ((void *)0); [L630] struct DItem* item, * item2; [L631] struct TLItem *lItem; [L632] int c1 = 0; VAL [c1=0, data={0:0}] [L633] c1 < 5 && __VERIFIER_nondet_int() [L633] c1 < 5 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, c1=0, c1 < 5 && __VERIFIER_nondet_int()=0, data={0:0}] [L633] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L657] COND TRUE !data [L658] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 91 locations, 3 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 105 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-42-50-038.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-42-50-038.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-42-50-038.csv Received shutdown request...