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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-properties/list_flag_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:51:09,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:51:09,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:51:09,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:51:09,969 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:51:09,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:51:09,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:51:09,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:51:09,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:51:09,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:51:09,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:51:09,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:51:09,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:51:09,980 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:51:09,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:51:09,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:51:09,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:51:09,988 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:51:09,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:51:09,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:51:09,994 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:51:09,994 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:51:09,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:51:09,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:51:09,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:51:09,998 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:51:09,998 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:51:09,999 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:51:09,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:51:09,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:51:10,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:51:10,000 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:51:10,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:51:10,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:51:10,011 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:51:10,011 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:51:10,011 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:51:10,011 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:51:10,011 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:51:10,011 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:51:10,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:51:10,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:51:10,012 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:51:10,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:51:10,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:51:10,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:51:10,012 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:51:10,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:51:10,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:51:10,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:51:10,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:51:10,013 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:51:10,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:51:10,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:51:10,014 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:51:10,014 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:51:10,014 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:51:10,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:51:10,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:51:10,015 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:51:10,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:51:10,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:51:10,015 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:51:10,015 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:51:10,015 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:51:10,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:51:10,015 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:51:10,016 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:51:10,016 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:51:10,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:51:10,062 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:51:10,066 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:51:10,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:51:10,067 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:51:10,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag_true-unreach-call_false-valid-memtrack.i [2018-01-23 14:51:10,247 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:51:10,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:51:10,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:51:10,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:51:10,258 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:51:10,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1266e3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10, skipping insertion in model container [2018-01-23 14:51:10,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,276 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:51:10,311 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:51:10,429 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:51:10,444 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:51:10,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10 WrapperNode [2018-01-23 14:51:10,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:51:10,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:51:10,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:51:10,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:51:10,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (1/1) ... [2018-01-23 14:51:10,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:51:10,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:51:10,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:51:10,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:51:10,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (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-23 14:51:10,539 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:51:10,539 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:51:10,539 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-23 14:51:10,539 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:51:10,539 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:51:10,539 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-23 14:51:10,540 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:51:10,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:51:10,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:51:10,752 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:51:10,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:51:10 BoogieIcfgContainer [2018-01-23 14:51:10,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:51:10,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:51:10,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:51:10,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:51:10,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:51:10" (1/3) ... [2018-01-23 14:51:10,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee9d927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:51:10, skipping insertion in model container [2018-01-23 14:51:10,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:10" (2/3) ... [2018-01-23 14:51:10,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee9d927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:51:10, skipping insertion in model container [2018-01-23 14:51:10,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:51:10" (3/3) ... [2018-01-23 14:51:10,759 INFO L105 eAbstractionObserver]: Analyzing ICFG list_flag_true-unreach-call_false-valid-memtrack.i [2018-01-23 14:51:10,766 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:51:10,771 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-23 14:51:10,809 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:10,809 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:10,809 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:10,809 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:10,809 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:10,809 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:10,810 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:10,810 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-23 14:51:10,811 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-23 14:51:10,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:51:10,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 49 states. [2018-01-23 14:51:10,938 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-23 14:51:10,938 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:51:10,939 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-23 14:51:10,939 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-23 14:51:10,939 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:51:10,939 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 653) no Hoare annotation was computed. [2018-01-23 14:51:10,939 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 653) no Hoare annotation was computed. [2018-01-23 14:51:10,940 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 653) the Hoare annotation is: true [2018-01-23 14:51:10,940 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 653) no Hoare annotation was computed. [2018-01-23 14:51:10,940 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 653) the Hoare annotation is: true [2018-01-23 14:51:10,940 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 653) no Hoare annotation was computed. [2018-01-23 14:51:10,940 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 653) the Hoare annotation is: true [2018-01-23 14:51:10,941 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 653) no Hoare annotation was computed. [2018-01-23 14:51:10,941 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 653) no Hoare annotation was computed. [2018-01-23 14:51:10,941 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-23 14:51:10,941 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-23 14:51:10,941 INFO L404 ceAbstractionStarter]: At program point L649'''(lines 649 650) the Hoare annotation is: true [2018-01-23 14:51:10,941 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-23 14:51:10,942 INFO L401 ceAbstractionStarter]: For program point L647'(line 647) no Hoare annotation was computed. [2018-01-23 14:51:10,942 INFO L404 ceAbstractionStarter]: At program point L639'(line 639) the Hoare annotation is: true [2018-01-23 14:51:10,942 INFO L401 ceAbstractionStarter]: For program point L639'''(line 639) no Hoare annotation was computed. [2018-01-23 14:51:10,942 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-23 14:51:10,942 INFO L401 ceAbstractionStarter]: For program point L651''(lines 651 652) no Hoare annotation was computed. [2018-01-23 14:51:10,942 INFO L401 ceAbstractionStarter]: For program point L651(line 651) no Hoare annotation was computed. [2018-01-23 14:51:10,943 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-23 14:51:10,943 INFO L404 ceAbstractionStarter]: At program point L646'''(lines 646 647) the Hoare annotation is: true [2018-01-23 14:51:10,943 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 653) no Hoare annotation was computed. [2018-01-23 14:51:10,943 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 653) the Hoare annotation is: true [2018-01-23 14:51:10,943 INFO L401 ceAbstractionStarter]: For program point L636'(line 636) no Hoare annotation was computed. [2018-01-23 14:51:10,943 INFO L401 ceAbstractionStarter]: For program point L632'(lines 632 642) no Hoare annotation was computed. [2018-01-23 14:51:10,944 INFO L404 ceAbstractionStarter]: At program point L632'''(lines 632 642) the Hoare annotation is: true [2018-01-23 14:51:10,944 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-23 14:51:10,944 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-23 14:51:10,944 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-23 14:51:10,944 INFO L401 ceAbstractionStarter]: For program point L645(lines 645 650) no Hoare annotation was computed. [2018-01-23 14:51:10,944 INFO L401 ceAbstractionStarter]: For program point L632''''(lines 632 642) no Hoare annotation was computed. [2018-01-23 14:51:10,945 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-23 14:51:10,945 INFO L401 ceAbstractionStarter]: For program point L649(lines 649 650) no Hoare annotation was computed. [2018-01-23 14:51:10,945 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-23 14:51:10,945 INFO L401 ceAbstractionStarter]: For program point L646(lines 646 647) no Hoare annotation was computed. [2018-01-23 14:51:10,945 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-23 14:51:10,945 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-23 14:51:10,946 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 653) no Hoare annotation was computed. [2018-01-23 14:51:10,946 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-23 14:51:10,946 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-23 14:51:10,946 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2018-01-23 14:51:10,946 INFO L401 ceAbstractionStarter]: For program point L632(lines 632 642) no Hoare annotation was computed. [2018-01-23 14:51:10,946 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-23 14:51:10,947 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-23 14:51:10,947 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-23 14:51:10,947 INFO L401 ceAbstractionStarter]: For program point L646'(line 646) no Hoare annotation was computed. [2018-01-23 14:51:10,947 INFO L401 ceAbstractionStarter]: For program point L649''''(lines 649 650) no Hoare annotation was computed. [2018-01-23 14:51:10,951 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:10,951 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:10,951 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:10,952 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:10,952 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:10,952 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:10,952 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:10,952 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:51:10,952 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-23 14:51:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:51:10,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:10,956 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:51:10,956 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:51:10,960 INFO L82 PathProgramCache]: Analyzing trace with hash 139664, now seen corresponding path program 1 times [2018-01-23 14:51:10,961 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:10,962 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:10,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:10,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:10,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:51:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:51:11,029 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:51:11,034 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:51:11,039 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:11,040 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:11,040 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:11,040 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:11,040 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:11,040 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:11,040 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:11,041 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:51:11,041 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-23 14:51:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-23 14:51:11,045 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:11,045 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-23 14:51:11,045 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:11,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1574628710, now seen corresponding path program 1 times [2018-01-23 14:51:11,046 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:11,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:11,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:11,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:11,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:11,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:11,112 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-23 14:51:11,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:11,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:51:11,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:51:11,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:51:11,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:51:11,192 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-23 14:51:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:11,210 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2018-01-23 14:51:11,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:51:11,211 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-23 14:51:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:11,217 INFO L225 Difference]: With dead ends: 71 [2018-01-23 14:51:11,217 INFO L226 Difference]: Without dead ends: 41 [2018-01-23 14:51:11,219 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-23 14:51:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-23 14:51:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-23 14:51:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-23 14:51:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-23 14:51:11,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-01-23 14:51:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:11,251 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-23 14:51:11,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:51:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-23 14:51:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:51:11,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:11,252 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:11,252 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash 456771048, now seen corresponding path program 1 times [2018-01-23 14:51:11,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:11,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:11,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:11,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:11,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:11,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:11,333 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-23 14:51:11,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:11,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:51:11,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:51:11,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:51:11,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:51:11,336 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 4 states. [2018-01-23 14:51:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:11,410 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-01-23 14:51:11,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:51:11,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-23 14:51:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:11,412 INFO L225 Difference]: With dead ends: 67 [2018-01-23 14:51:11,412 INFO L226 Difference]: Without dead ends: 48 [2018-01-23 14:51:11,413 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:51:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-23 14:51:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-23 14:51:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-23 14:51:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-23 14:51:11,420 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 24 [2018-01-23 14:51:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:11,421 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-23 14:51:11,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:51:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-23 14:51:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-23 14:51:11,422 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:11,422 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:11,423 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 590533786, now seen corresponding path program 1 times [2018-01-23 14:51:11,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:11,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:11,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:11,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:11,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:11,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:11,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:11,596 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:51:11,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:11,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:11,688 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:51:11,713 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) |main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:51:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-23 14:51:11,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:11,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-01-23 14:51:11,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:51:11,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:51:11,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2018-01-23 14:51:11,781 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 8 states. [2018-01-23 14:51:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:11,995 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-01-23 14:51:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:51:12,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-23 14:51:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:12,023 INFO L225 Difference]: With dead ends: 97 [2018-01-23 14:51:12,023 INFO L226 Difference]: Without dead ends: 69 [2018-01-23 14:51:12,024 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=46, Unknown=5, NotChecked=30, Total=110 [2018-01-23 14:51:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-23 14:51:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-01-23 14:51:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-23 14:51:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-23 14:51:12,033 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 35 [2018-01-23 14:51:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:12,033 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-23 14:51:12,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:51:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-23 14:51:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:51:12,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:12,035 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:12,035 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1507196248, now seen corresponding path program 2 times [2018-01-23 14:51:12,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:12,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:12,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:12,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:12,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:12,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:12,256 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:12,256 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:51:12,261 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:51:12,282 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:51:12,292 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:51:12,294 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:51:12,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:12,304 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:51:12,321 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (and (= (select .cse0 |main_#t~malloc5.base|) 0) (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))) is different from true [2018-01-23 14:51:12,350 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse1 (store .cse0 v_prenex_1 1))) (and (= (select .cse0 v_prenex_1) 0) (= (select .cse1 |main_#t~malloc5.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= |c_#valid| (store .cse1 |main_#t~malloc5.base| 1)))))) is different from true [2018-01-23 14:51:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2018-01-23 14:51:12,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:12,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-01-23 14:51:12,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:51:12,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:51:12,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=41, Unknown=3, NotChecked=42, Total=110 [2018-01-23 14:51:12,455 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 11 states. [2018-01-23 14:51:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:12,698 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2018-01-23 14:51:12,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:51:12,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-01-23 14:51:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:12,700 INFO L225 Difference]: With dead ends: 161 [2018-01-23 14:51:12,700 INFO L226 Difference]: Without dead ends: 104 [2018-01-23 14:51:12,701 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=93, Unknown=4, NotChecked=66, Total=210 [2018-01-23 14:51:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-23 14:51:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2018-01-23 14:51:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-23 14:51:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-01-23 14:51:12,713 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 46 [2018-01-23 14:51:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:12,713 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-01-23 14:51:12,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:51:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-01-23 14:51:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-23 14:51:12,715 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:12,715 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-23 14:51:12,715 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1698580536, now seen corresponding path program 1 times [2018-01-23 14:51:12,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:12,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:12,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:12,717 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:51:12,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:12,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-23 14:51:12,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:12,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:51:12,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:51:12,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:51:12,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:51:12,774 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 3 states. [2018-01-23 14:51:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:12,815 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2018-01-23 14:51:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:51:12,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-01-23 14:51:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:12,823 INFO L225 Difference]: With dead ends: 190 [2018-01-23 14:51:12,823 INFO L226 Difference]: Without dead ends: 137 [2018-01-23 14:51:12,824 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-23 14:51:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-23 14:51:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-01-23 14:51:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-23 14:51:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-01-23 14:51:12,845 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 68 [2018-01-23 14:51:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:12,845 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-01-23 14:51:12,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:51:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-01-23 14:51:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-23 14:51:12,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:12,847 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-23 14:51:12,847 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1820830472, now seen corresponding path program 2 times [2018-01-23 14:51:12,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:12,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:12,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:12,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:12,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:12,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-23 14:51:12,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:12,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:51:12,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:51:12,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:51:12,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:51:12,895 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 3 states. [2018-01-23 14:51:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:12,909 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-01-23 14:51:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:51:12,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-01-23 14:51:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:12,911 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:51:12,911 INFO L226 Difference]: Without dead ends: 137 [2018-01-23 14:51:12,912 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-23 14:51:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-23 14:51:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-01-23 14:51:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-23 14:51:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-01-23 14:51:12,925 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 68 [2018-01-23 14:51:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:12,925 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-01-23 14:51:12,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:51:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-01-23 14:51:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-23 14:51:12,927 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:12,928 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:12,928 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1039035672, now seen corresponding path program 1 times [2018-01-23 14:51:12,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:12,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:12,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:12,929 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:51:12,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:12,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:13,663 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 45 DAG size of output 42 [2018-01-23 14:51:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:14,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:14,472 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:51:14,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:14,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:14,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:14,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:14,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:14,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:14,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:14,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-01-23 14:51:14,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-23 14:51:14,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-01-23 14:51:14,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:14,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:14,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:14,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2018-01-23 14:51:14,894 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (and (= (select |c_old(#valid)| main_~p~6.base) 0) (= (select .cse0 |c_main_#t~mem7.base|) 0) (= (store .cse0 |c_main_#t~mem7.base| 1) |c_#valid|)))) is different from true [2018-01-23 14:51:14,904 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= |c_#valid| (store .cse0 c_main_~p~6.base 1)) (= 0 (select .cse0 c_main_~p~6.base)) (= (select |c_old(#valid)| v_subst_1) 0)))) is different from true [2018-01-23 14:51:15,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:15,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:15,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:15,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:15,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:15,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:49 [2018-01-23 14:51:15,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-23 14:51:15,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-01-23 14:51:15,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:15,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:15,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:15,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:37 [2018-01-23 14:51:15,111 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse0 (store .cse1 main_~p~6.base 1))) (and (= (select .cse0 |c_main_#t~mem7.base|) 0) (= 0 (select .cse1 main_~p~6.base)) (= |c_#valid| (store .cse0 |c_main_#t~mem7.base| 1)) (= (select |c_old(#valid)| v_subst_1) 0))))) is different from true [2018-01-23 14:51:15,114 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse0 (store .cse1 v_subst_2 1))) (and (= |c_#valid| (store .cse0 main_~p~6.base 1)) (= 0 (select .cse1 v_subst_2)) (= (select |c_old(#valid)| v_subst_1) 0) (= 0 (select .cse0 main_~p~6.base)))))) is different from true [2018-01-23 14:51:15,141 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (|main_#t~malloc5.base| Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse0 (store .cse1 v_subst_2 1))) (and (= |c_#valid| (store (store .cse0 main_~p~6.base 1) |main_#t~malloc5.base| 1)) (= 0 (select .cse1 v_subst_2)) (= (select |c_old(#valid)| v_subst_1) 0) (= 0 (select .cse0 main_~p~6.base)))))) is different from true [2018-01-23 14:51:15,170 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (main_~p~6.base Int) (|main_#t~malloc5.base| Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse1 (store .cse0 v_subst_2 1))) (and (= 0 (select .cse0 v_subst_2)) (= (store (store (store .cse1 main_~p~6.base 1) v_prenex_2 1) |main_#t~malloc5.base| 1) |c_#valid|) (= (select |c_old(#valid)| v_subst_1) 0) (= 0 (select .cse1 main_~p~6.base)))))) is different from true [2018-01-23 14:51:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 74 not checked. [2018-01-23 14:51:15,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:15,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 39 [2018-01-23 14:51:15,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-23 14:51:15,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-23 14:51:15,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=876, Unknown=6, NotChecked=402, Total=1482 [2018-01-23 14:51:15,292 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 39 states. [2018-01-23 14:51:16,282 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 81 DAG size of output 70 [2018-01-23 14:51:16,466 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 76 DAG size of output 65 [2018-01-23 14:51:16,741 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 86 DAG size of output 75 [2018-01-23 14:51:17,142 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 106 DAG size of output 94 [2018-01-23 14:51:17,477 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 120 DAG size of output 107 [2018-01-23 14:51:18,287 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 91 DAG size of output 65 [2018-01-23 14:51:18,683 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 119 DAG size of output 84 [2018-01-23 14:51:18,835 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 89 DAG size of output 85 [2018-01-23 14:51:19,071 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 125 DAG size of output 91 [2018-01-23 14:51:20,132 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 121 DAG size of output 86 [2018-01-23 14:51:20,396 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 135 DAG size of output 96 [2018-01-23 14:51:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:21,579 INFO L93 Difference]: Finished difference Result 198 states and 207 transitions. [2018-01-23 14:51:21,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-23 14:51:21,580 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 68 [2018-01-23 14:51:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:21,581 INFO L225 Difference]: With dead ends: 198 [2018-01-23 14:51:21,581 INFO L226 Difference]: Without dead ends: 175 [2018-01-23 14:51:21,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1132, Invalid=4496, Unknown=96, NotChecked=918, Total=6642 [2018-01-23 14:51:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-23 14:51:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 161. [2018-01-23 14:51:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-23 14:51:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2018-01-23 14:51:21,600 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 68 [2018-01-23 14:51:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:21,601 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2018-01-23 14:51:21,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-23 14:51:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2018-01-23 14:51:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-23 14:51:21,602 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:21,602 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:21,602 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1491371238, now seen corresponding path program 3 times [2018-01-23 14:51:21,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:21,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:21,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:21,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:21,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:21,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:23,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:23,178 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:51:23,182 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:51:23,194 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:23,198 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:23,204 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:23,232 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:23,289 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:23,508 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:23,511 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:51:23,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:23,522 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:51:23,537 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) |c_main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:51:23,544 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) c_main_~t~6.base 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:51:23,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:23,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:23,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:23,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-01-23 14:51:23,558 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)) 1)))) is different from true [2018-01-23 14:51:23,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-01-23 14:51:23,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-01-23 14:51:23,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:23,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-23 14:51:23,568 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) |c_main_#t~mem7.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:51:23,570 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) c_main_~p~6.base 1)))) is different from true [2018-01-23 14:51:23,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:23,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:23,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:23,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2018-01-23 14:51:23,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-23 14:51:23,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-01-23 14:51:23,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:23,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:29 [2018-01-23 14:51:23,683 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) main_~p~6.base 1))) (and (= 0 (select .cse0 |c_main_#t~mem7.base|)) (= |c_#valid| (store .cse0 |c_main_#t~mem7.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))) is different from true [2018-01-23 14:51:23,686 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (and (= (select .cse0 c_main_~p~6.base) 0) (= |c_#valid| (store .cse0 c_main_~p~6.base 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))) is different from true [2018-01-23 14:51:23,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:23,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:23,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:23,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:58 [2018-01-23 14:51:23,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-01-23 14:51:23,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-01-23 14:51:23,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:23,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:46 [2018-01-23 14:51:23,847 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse1 (store .cse0 main_~p~6.base 1))) (and (= (select .cse0 main_~p~6.base) 0) (= 0 (select .cse1 |c_main_#t~mem7.base|)) (= |c_#valid| (store .cse1 |c_main_#t~mem7.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-23 14:51:23,852 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse1 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse0 (store .cse1 v_subst_4 1))) (and (= 0 (select .cse0 c_main_~p~6.base)) (= |c_#valid| (store .cse0 c_main_~p~6.base 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse1 v_subst_4) 0))))) is different from true [2018-01-23 14:51:23,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:23,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:23,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:23,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:23,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:79, output treesize:78 [2018-01-23 14:51:24,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-01-23 14:51:24,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-01-23 14:51:24,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:24,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:24,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:24,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:87, output treesize:66 [2018-01-23 14:51:24,054 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse2 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse1 (store .cse2 v_subst_4 1))) (let ((.cse0 (store .cse1 main_~p~6.base 1))) (and (= (select .cse0 |c_main_#t~mem7.base|) 0) (= 0 (select .cse1 main_~p~6.base)) (= (store .cse0 |c_main_#t~mem7.base| 1) |c_#valid|) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse2 v_subst_4) 0)))))) is different from true [2018-01-23 14:51:24,058 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse2 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse0 (store .cse2 v_subst_4 1))) (let ((.cse1 (store .cse0 v_subst_5 1))) (and (= 0 (select .cse0 v_subst_5)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= 0 (select .cse1 main_~p~6.base)) (= (select .cse2 v_subst_4) 0) (= |c_#valid| (store .cse1 main_~p~6.base 1))))))) is different from true [2018-01-23 14:51:24,067 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (|main_#t~malloc5.base| Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse3 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse1 (store .cse3 v_subst_4 1))) (let ((.cse2 (store .cse1 v_subst_5 1))) (let ((.cse0 (store .cse2 main_~p~6.base 1))) (and (= 0 (select .cse0 |main_#t~malloc5.base|)) (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= 0 (select .cse1 v_subst_5)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= 0 (select .cse2 main_~p~6.base)) (= (select .cse3 v_subst_4) 0))))))) is different from true [2018-01-23 14:51:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 113 not checked. [2018-01-23 14:51:24,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:24,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 37 [2018-01-23 14:51:24,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-23 14:51:24,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-23 14:51:24,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=458, Unknown=15, NotChecked=728, Total=1332 [2018-01-23 14:51:24,166 INFO L87 Difference]: Start difference. First operand 161 states and 166 transitions. Second operand 37 states. [2018-01-23 14:51:24,660 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 37 DAG size of output 19 [2018-01-23 14:51:25,456 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 70 DAG size of output 52 [2018-01-23 14:51:26,549 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 73 DAG size of output 55 [2018-01-23 14:51:28,175 WARN L143 SmtUtils]: Spent 350ms on a formula simplification that was a NOOP. DAG size: 79 [2018-01-23 14:51:29,580 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((main_~p~6.base Int) (|main_#t~malloc5.base| Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse3 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse1 (store .cse3 v_subst_4 1))) (let ((.cse2 (store .cse1 v_subst_5 1))) (let ((.cse0 (store .cse2 main_~p~6.base 1))) (and (= 0 (select .cse0 |main_#t~malloc5.base|)) (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= 0 (select .cse1 v_subst_5)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= 0 (select .cse2 main_~p~6.base)) (= (select .cse3 v_subst_4) 0))))))) (exists ((main_~p~6.base Int) (v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse6 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse5 (store .cse6 v_subst_4 1))) (let ((.cse4 (store .cse5 main_~p~6.base 1))) (and (= (select .cse4 |c_main_#t~mem7.base|) 0) (= 0 (select .cse5 main_~p~6.base)) (= (store .cse4 |c_main_#t~mem7.base| 1) |c_#valid|) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse6 v_subst_4) 0)))))) (exists ((v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse10 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse7 (store .cse10 v_subst_4 1))) (let ((.cse8 (store .cse7 c_main_~p~6.base 1)) (.cse9 (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)))) (and (= 0 (select .cse7 c_main_~p~6.base)) (= (store .cse8 .cse9 1) |c_#valid|) (= (select .cse8 .cse9) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse10 v_subst_4) 0)))))) (exists ((v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse13 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse11 (store .cse13 v_subst_4 1))) (let ((.cse12 (store .cse11 c_main_~p~6.base 1))) (and (= 0 (select .cse11 c_main_~p~6.base)) (= |c_#valid| (store .cse12 c_main_~t~6.base 1)) (= (select .cse12 c_main_~t~6.base) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse13 v_subst_4) 0)))))) (exists ((v_subst_4 Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse16 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_subst_3 1))) (let ((.cse15 (store .cse16 v_subst_4 1))) (let ((.cse14 (store .cse15 c_main_~p~6.base 1))) (and (= |c_#valid| (store .cse14 |c_main_#t~malloc5.base| 1)) (= 0 (select .cse15 c_main_~p~6.base)) (= 0 (select .cse14 |c_main_#t~malloc5.base|)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse16 v_subst_4) 0))))))) is different from true [2018-01-23 14:51:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:30,255 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2018-01-23 14:51:30,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-23 14:51:30,255 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2018-01-23 14:51:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:30,256 INFO L225 Difference]: With dead ends: 266 [2018-01-23 14:51:30,256 INFO L226 Difference]: Without dead ends: 205 [2018-01-23 14:51:30,258 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=506, Invalid=2261, Unknown=45, NotChecked=1610, Total=4422 [2018-01-23 14:51:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-23 14:51:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2018-01-23 14:51:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-23 14:51:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2018-01-23 14:51:30,275 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 79 [2018-01-23 14:51:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:30,276 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2018-01-23 14:51:30,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-23 14:51:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2018-01-23 14:51:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-23 14:51:30,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:30,277 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:30,277 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1252800966, now seen corresponding path program 2 times [2018-01-23 14:51:30,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:30,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:30,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:30,278 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:51:30,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:30,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:43,197 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-01-23 14:51:43,562 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 61 DAG size of output 49 [2018-01-23 14:51:44,124 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 52 DAG size of output 42 [2018-01-23 14:51:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:45,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:45,009 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:51:45,014 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:51:45,028 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:51:45,044 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:51:45,053 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:51:45,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:45,061 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-23 14:51:45,068 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (and (= (select .cse0 |main_#t~malloc5.base|) 0) (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))) is different from true [2018-01-23 14:51:45,080 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse0 (store .cse1 v_prenex_3 1))) (and (= (store .cse0 |main_#t~malloc5.base| 1) |c_#valid|) (= (select .cse0 |main_#t~malloc5.base|) 0) (= (select .cse1 v_prenex_3) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-23 14:51:45,096 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse2 (store .cse1 v_prenex_3 1))) (let ((.cse0 (store .cse2 v_prenex_4 1))) (and (= (select .cse0 |main_#t~malloc5.base|) 0) (= (select .cse1 v_prenex_3) 0) (= (select .cse2 v_prenex_4) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (store .cse0 |main_#t~malloc5.base| 1) |c_#valid|)))))) is different from true [2018-01-23 14:51:45,109 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse2 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse3 (store .cse2 v_prenex_3 1))) (let ((.cse1 (store .cse3 v_prenex_4 1))) (let ((.cse0 (store .cse1 v_prenex_5 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= (select .cse1 v_prenex_5) 0) (= (select .cse2 v_prenex_3) 0) (= (select .cse3 v_prenex_4) 0) (= (select .cse0 |main_#t~malloc5.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))))) is different from true [2018-01-23 14:51:45,132 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse2 (store .cse1 v_prenex_3 1))) (let ((.cse0 (store .cse2 v_prenex_4 1))) (let ((.cse4 (store .cse0 v_prenex_5 1))) (let ((.cse3 (store .cse4 v_prenex_6 1))) (and (= (select .cse0 v_prenex_5) 0) (= (select .cse1 v_prenex_3) 0) (= (select .cse2 v_prenex_4) 0) (= 0 (select .cse3 |c_main_#t~malloc5.base|)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (store .cse3 |c_main_#t~malloc5.base| 1) |c_#valid|) (= (select .cse4 v_prenex_6) 0)))))))) is different from true [2018-01-23 14:51:45,138 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse2 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse3 (store .cse2 v_prenex_3 1))) (let ((.cse1 (store .cse3 v_prenex_4 1))) (let ((.cse4 (store .cse1 v_prenex_5 1))) (let ((.cse0 (store .cse4 v_prenex_6 1))) (and (= |c_#valid| (store .cse0 c_main_~t~6.base 1)) (= (select .cse1 v_prenex_5) 0) (= (select .cse2 v_prenex_3) 0) (= (select .cse3 v_prenex_4) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse0 c_main_~t~6.base) 0) (= (select .cse4 v_prenex_6) 0)))))))) is different from true [2018-01-23 14:51:45,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:45,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:45,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:45,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:110, output treesize:109 [2018-01-23 14:51:45,174 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse3 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse4 (store .cse3 v_prenex_3 1))) (let ((.cse0 (store .cse4 v_prenex_4 1))) (let ((.cse5 (store .cse0 v_prenex_5 1))) (let ((.cse1 (store .cse5 v_prenex_6 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)))) (and (= (select .cse0 v_prenex_5) 0) (= 0 (select .cse1 .cse2)) (= (select .cse3 v_prenex_3) 0) (= (select .cse4 v_prenex_4) 0) (= |c_#valid| (store .cse1 .cse2 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse5 v_prenex_6) 0)))))))) is different from true [2018-01-23 14:51:45,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-01-23 14:51:45,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2018-01-23 14:51:45,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:45,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:118, output treesize:97 [2018-01-23 14:51:45,203 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse2 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse3 (store .cse2 v_prenex_3 1))) (let ((.cse1 (store .cse3 v_prenex_4 1))) (let ((.cse4 (store .cse1 v_prenex_5 1))) (let ((.cse0 (store .cse4 v_prenex_6 1))) (and (= (store .cse0 |c_main_#t~mem7.base| 1) |c_#valid|) (= 0 (select .cse0 |c_main_#t~mem7.base|)) (= (select .cse1 v_prenex_5) 0) (= (select .cse2 v_prenex_3) 0) (= (select .cse3 v_prenex_4) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse4 v_prenex_6) 0)))))))) is different from true [2018-01-23 14:51:45,209 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse2 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse3 (store .cse2 v_prenex_3 1))) (let ((.cse1 (store .cse3 v_prenex_4 1))) (let ((.cse4 (store .cse1 v_prenex_5 1))) (let ((.cse0 (store .cse4 v_prenex_6 1))) (and (= 0 (select .cse0 c_main_~p~6.base)) (= (select .cse1 v_prenex_5) 0) (= (store .cse0 c_main_~p~6.base 1) |c_#valid|) (= (select .cse2 v_prenex_3) 0) (= (select .cse3 v_prenex_4) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse4 v_prenex_6) 0)))))))) is different from true [2018-01-23 14:51:45,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:45,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:45,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:45,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:136, output treesize:135 [2018-01-23 14:51:45,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-01-23 14:51:45,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2018-01-23 14:51:45,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:45,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:144, output treesize:123 [2018-01-23 14:51:45,373 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (main_~p~6.base Int) (|main_#t~malloc1.base| Int)) (let ((.cse2 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse3 (store .cse2 v_prenex_3 1))) (let ((.cse1 (store .cse3 v_prenex_4 1))) (let ((.cse5 (store .cse1 v_prenex_5 1))) (let ((.cse0 (store .cse5 v_prenex_6 1))) (let ((.cse4 (store .cse0 main_~p~6.base 1))) (and (= 0 (select .cse0 main_~p~6.base)) (= (select .cse1 v_prenex_5) 0) (= (select .cse2 v_prenex_3) 0) (= (select .cse3 v_prenex_4) 0) (= (select .cse4 |c_main_#t~mem7.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse5 v_prenex_6) 0) (= |c_#valid| (store .cse4 |c_main_#t~mem7.base| 1)))))))))) is different from true [2018-01-23 14:51:45,379 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_subst_6 Int) (|main_#t~malloc1.base| Int)) (let ((.cse3 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse4 (store .cse3 v_prenex_3 1))) (let ((.cse0 (store .cse4 v_prenex_4 1))) (let ((.cse5 (store .cse0 v_prenex_5 1))) (let ((.cse1 (store .cse5 v_prenex_6 1))) (let ((.cse2 (store .cse1 v_subst_6 1))) (and (= (select .cse0 v_prenex_5) 0) (= 0 (select .cse1 v_subst_6)) (= |c_#valid| (store .cse2 c_main_~p~6.base 1)) (= (select .cse3 v_prenex_3) 0) (= (select .cse4 v_prenex_4) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse2 c_main_~p~6.base) 0) (= (select .cse5 v_prenex_6) 0))))))))) is different from true [2018-01-23 14:51:45,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:45,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:45,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:45,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:165, output treesize:164 [2018-01-23 14:51:45,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-01-23 14:51:45,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2018-01-23 14:51:45,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:45,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:45,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:173, output treesize:152 [2018-01-23 14:51:45,683 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (main_~p~6.base Int) (v_subst_6 Int) (|main_#t~malloc1.base| Int)) (let ((.cse3 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse4 (store .cse3 v_prenex_3 1))) (let ((.cse1 (store .cse4 v_prenex_4 1))) (let ((.cse6 (store .cse1 v_prenex_5 1))) (let ((.cse2 (store .cse6 v_prenex_6 1))) (let ((.cse5 (store .cse2 v_subst_6 1))) (let ((.cse0 (store .cse5 main_~p~6.base 1))) (and (= (select .cse0 |c_main_#t~mem7.base|) 0) (= (select .cse1 v_prenex_5) 0) (= 0 (select .cse2 v_subst_6)) (= |c_#valid| (store .cse0 |c_main_#t~mem7.base| 1)) (= (select .cse3 v_prenex_3) 0) (= (select .cse4 v_prenex_4) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse5 main_~p~6.base) 0) (= (select .cse6 v_prenex_6) 0)))))))))) is different from true [2018-01-23 14:51:45,689 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_subst_7 Int) (main_~p~6.base Int) (v_subst_6 Int) (|main_#t~malloc1.base| Int)) (let ((.cse4 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse5 (store .cse4 v_prenex_3 1))) (let ((.cse0 (store .cse5 v_prenex_4 1))) (let ((.cse6 (store .cse0 v_prenex_5 1))) (let ((.cse1 (store .cse6 v_prenex_6 1))) (let ((.cse3 (store .cse1 v_subst_6 1))) (let ((.cse2 (store .cse3 v_subst_7 1))) (and (= (select .cse0 v_prenex_5) 0) (= 0 (select .cse1 v_subst_6)) (= 0 (select .cse2 main_~p~6.base)) (= (select .cse3 v_subst_7) 0) (= (select .cse4 v_prenex_3) 0) (= (select .cse5 v_prenex_4) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= |c_#valid| (store .cse2 main_~p~6.base 1)) (= (select .cse6 v_prenex_6) 0)))))))))) is different from true [2018-01-23 14:51:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 248 not checked. [2018-01-23 14:51:45,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:45,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23] total 32 [2018-01-23 14:51:45,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-23 14:51:45,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-23 14:51:45,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=188, Unknown=29, NotChecked=630, Total=992 [2018-01-23 14:51:45,806 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 32 states. [2018-01-23 14:51:49,515 WARN L143 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 69 [2018-01-23 14:51:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:50,596 INFO L93 Difference]: Finished difference Result 219 states and 225 transitions. [2018-01-23 14:51:50,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-23 14:51:50,596 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 101 [2018-01-23 14:51:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:50,597 INFO L225 Difference]: With dead ends: 219 [2018-01-23 14:51:50,597 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:51:50,598 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 106 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=397, Invalid=842, Unknown=223, NotChecked=1190, Total=2652 [2018-01-23 14:51:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:51:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:51:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:51:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:51:50,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2018-01-23 14:51:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:50,599 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:51:50,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-23 14:51:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:51:50,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:51:50,601 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:50,601 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:50,601 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:50,601 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:50,602 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:50,602 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:50,602 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:50,602 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:51:50,602 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-23 14:51:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-23 14:51:50,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:50,604 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:50,604 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:51:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1002754735, now seen corresponding path program 1 times [2018-01-23 14:51:50,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:50,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:50,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:50,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:50,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:50,612 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-23 14:51:50,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:50,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:51:50,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:51:50,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:51:50,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:51:50,613 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-23 14:51:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:50,616 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2018-01-23 14:51:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:51:50,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-23 14:51:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:50,617 INFO L225 Difference]: With dead ends: 71 [2018-01-23 14:51:50,617 INFO L226 Difference]: Without dead ends: 39 [2018-01-23 14:51:50,617 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-23 14:51:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-23 14:51:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-23 14:51:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-23 14:51:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-23 14:51:50,620 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-01-23 14:51:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:50,621 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-23 14:51:50,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:51:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-23 14:51:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:51:50,621 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:50,621 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-23 14:51:50,622 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:51:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1264327759, now seen corresponding path program 1 times [2018-01-23 14:51:50,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:50,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:50,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:50,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:51:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:51:50,636 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:51:50,640 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:51:50,643 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:51:50,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:51:50 BoogieIcfgContainer [2018-01-23 14:51:50,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:51:50,654 INFO L168 Benchmark]: Toolchain (without parser) took 40406.48 ms. Allocated memory was 307.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 265.7 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 76.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:51:50,655 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:51:50,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.98 ms. Allocated memory is still 307.8 MB. Free memory was 264.7 MB in the beginning and 254.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:51:50,656 INFO L168 Benchmark]: Boogie Preprocessor took 35.18 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:51:50,656 INFO L168 Benchmark]: RCFGBuilder took 266.00 ms. Allocated memory is still 307.8 MB. Free memory was 252.6 MB in the beginning and 233.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:51:50,656 INFO L168 Benchmark]: TraceAbstraction took 39900.29 ms. Allocated memory was 307.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 233.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 44.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:51:50,658 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.17 ms. Allocated memory is still 307.8 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.98 ms. Allocated memory is still 307.8 MB. Free memory was 264.7 MB in the beginning and 254.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.18 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 266.00 ms. Allocated memory is still 307.8 MB. Free memory was 252.6 MB in the beginning and 233.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 39900.29 ms. Allocated memory was 307.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 233.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 44.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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: exitErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 10 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. UNSAFE Result, 0.0s 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=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. SAFE Result, 39.5s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 483 SDtfs, 960 SDslu, 2097 SDs, 0 SdLazy, 2035 SolverSat, 194 SolverUnsat, 96 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 320 SyntacticMatches, 30 SemanticMatches, 221 ConstructedPredicates, 39 IntricatePredicates, 0 DeprecatedPredicates, 2400 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=8, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 824 ConstructedInterpolants, 271 QuantifiedInterpolants, 29386541 SizeOfPredicates, 74 NumberOfNonLiveVariables, 982 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 150/1100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 626]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; VAL [flag=1] [L629] EXPR, FCALL malloc(sizeof(struct node)) VAL [flag=1, malloc(sizeof(struct node))={10:0}] [L629] a = (List) malloc(sizeof(struct node)) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L630] COND FALSE !(a == 0) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L631] p = a VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] FCALL p->h = 3 VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L644] p = a VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L645] COND TRUE \read(flag) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L646] EXPR, FCALL p->h VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L646] COND FALSE !(p->h == 1) [L651] EXPR, FCALL p->h VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L651] COND FALSE !(p->h != 3) - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. UNSAFE Result, 0.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 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=49occurred 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, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 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 - InvariantResult [Line: 646]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 649]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-51-50-668.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-51-50-668.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-51-50-668.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-51-50-668.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-51-50-668.csv Received shutdown request...