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/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:51:49,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:51:49,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:51:49,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:51:49,072 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:51:49,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:51:49,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:51:49,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:51:49,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:51:49,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:51:49,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:51:49,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:51:49,077 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:51:49,078 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:51:49,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:51:49,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:51:49,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:51:49,085 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:51:49,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:51:49,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:51:49,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:51:49,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:51:49,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:51:49,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:51:49,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:51:49,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:51:49,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:51:49,095 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:51:49,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:51:49,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:51:49,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:51:49,096 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:49,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:51:49,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:51:49,106 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:51:49,107 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:51:49,107 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:51:49,107 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:51:49,107 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:51:49,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:51:49,108 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:51:49,108 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:51:49,108 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:51:49,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:51:49,109 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:51:49,109 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:51:49,109 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:51:49,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:51:49,109 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:51:49,109 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:51:49,110 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:51:49,110 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:51:49,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:51:49,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:51:49,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:51:49,111 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:51:49,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:51:49,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:51:49,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:51:49,111 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:51:49,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:51:49,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:51:49,112 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:51:49,112 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:51:49,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:51:49,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:51:49,113 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:51:49,113 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:51:49,114 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:51:49,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:51:49,159 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:51:49,163 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:51:49,164 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:51:49,165 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:51:49,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-01-23 14:51:49,343 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:51:49,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:51:49,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:51:49,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:51:49,358 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:51:49,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:51:49" (1/1) ... [2018-01-23 14:51:49,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c426a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:49, skipping insertion in model container [2018-01-23 14:51:49,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:51:49" (1/1) ... [2018-01-23 14:51:49,378 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:51:49,417 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:51:49,535 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:51:49,552 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:51:49,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:49 WrapperNode [2018-01-23 14:51:49,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:51:49,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:51:49,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:51:49,560 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:51:49,573 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:49" (1/1) ... [2018-01-23 14:51:49,573 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:49" (1/1) ... [2018-01-23 14:51:49,584 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:49" (1/1) ... [2018-01-23 14:51:49,584 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:49" (1/1) ... [2018-01-23 14:51:49,588 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:49" (1/1) ... [2018-01-23 14:51:49,590 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:49" (1/1) ... [2018-01-23 14:51:49,591 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:49" (1/1) ... [2018-01-23 14:51:49,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:51:49,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:51:49,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:51:49,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:51:49,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:49" (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:49,638 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:51:49,639 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:51:49,639 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-23 14:51:49,639 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:51:49,639 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:51:49,639 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:51:49,639 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:51:49,640 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:51:49,640 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:51:49,640 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:51:49,640 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:51:49,640 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:51:49,640 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:51:49,641 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:51:49,641 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-23 14:51:49,641 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:51:49,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:51:49,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:51:49,821 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:51:49,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:51:49 BoogieIcfgContainer [2018-01-23 14:51:49,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:51:49,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:51:49,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:51:49,825 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:51:49,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:51:49" (1/3) ... [2018-01-23 14:51:49,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce8f6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:51:49, skipping insertion in model container [2018-01-23 14:51:49,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:49" (2/3) ... [2018-01-23 14:51:49,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce8f6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:51:49, skipping insertion in model container [2018-01-23 14:51:49,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:51:49" (3/3) ... [2018-01-23 14:51:49,829 INFO L105 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-01-23 14:51:49,838 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:51:49,845 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-23 14:51:49,890 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:49,891 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:49,891 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:49,891 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:49,891 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:49,891 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:49,892 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:49,892 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-23 14:51:49,892 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-23 14:51:49,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:51:49,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 41 states. [2018-01-23 14:51:49,993 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-23 14:51:49,993 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:51:49,994 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-23 14:51:49,994 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-23 14:51:49,994 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:51:49,994 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 648) no Hoare annotation was computed. [2018-01-23 14:51:49,994 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 648) no Hoare annotation was computed. [2018-01-23 14:51:49,995 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 648) the Hoare annotation is: true [2018-01-23 14:51:49,995 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 648) no Hoare annotation was computed. [2018-01-23 14:51:49,995 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 648) the Hoare annotation is: true [2018-01-23 14:51:49,995 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 648) no Hoare annotation was computed. [2018-01-23 14:51:49,995 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 648) the Hoare annotation is: true [2018-01-23 14:51:49,996 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 648) no Hoare annotation was computed. [2018-01-23 14:51:49,996 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 648) no Hoare annotation was computed. [2018-01-23 14:51:49,996 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-23 14:51:49,996 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-23 14:51:49,996 INFO L401 ceAbstractionStarter]: For program point L631'(lines 631 637) no Hoare annotation was computed. [2018-01-23 14:51:49,997 INFO L404 ceAbstractionStarter]: At program point L631'''(lines 631 637) the Hoare annotation is: true [2018-01-23 14:51:49,997 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 648) no Hoare annotation was computed. [2018-01-23 14:51:49,997 INFO L401 ceAbstractionStarter]: For program point L642'''(lines 642 644) no Hoare annotation was computed. [2018-01-23 14:51:49,997 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 648) no Hoare annotation was computed. [2018-01-23 14:51:49,997 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 648) the Hoare annotation is: true [2018-01-23 14:51:49,997 INFO L401 ceAbstractionStarter]: For program point L632'(line 632) no Hoare annotation was computed. [2018-01-23 14:51:49,998 INFO L401 ceAbstractionStarter]: For program point L631''''(lines 631 637) no Hoare annotation was computed. [2018-01-23 14:51:49,998 INFO L404 ceAbstractionStarter]: At program point L628'(line 628) the Hoare annotation is: true [2018-01-23 14:51:49,998 INFO L401 ceAbstractionStarter]: For program point L641(lines 641 646) no Hoare annotation was computed. [2018-01-23 14:51:49,998 INFO L404 ceAbstractionStarter]: At program point L641''(lines 641 646) the Hoare annotation is: true [2018-01-23 14:51:49,998 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-23 14:51:49,998 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-23 14:51:49,998 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-23 14:51:49,999 INFO L401 ceAbstractionStarter]: For program point L628'''(line 628) no Hoare annotation was computed. [2018-01-23 14:51:49,999 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 648) no Hoare annotation was computed. [2018-01-23 14:51:49,999 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-23 14:51:49,999 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-23 14:51:49,999 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-23 14:51:49,999 INFO L401 ceAbstractionStarter]: For program point L631(lines 631 637) no Hoare annotation was computed. [2018-01-23 14:51:49,999 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-23 14:51:50,000 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-23 14:51:50,000 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-23 14:51:50,000 INFO L401 ceAbstractionStarter]: For program point L641'''(lines 641 646) no Hoare annotation was computed. [2018-01-23 14:51:50,000 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-23 14:51:50,000 INFO L404 ceAbstractionStarter]: At program point L634'(line 634) the Hoare annotation is: true [2018-01-23 14:51:50,000 INFO L401 ceAbstractionStarter]: For program point L642'(line 642) no Hoare annotation was computed. [2018-01-23 14:51:50,001 INFO L401 ceAbstractionStarter]: For program point L634'''(line 634) no Hoare annotation was computed. [2018-01-23 14:51:50,004 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:50,004 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:50,005 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:50,005 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:50,005 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:50,005 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:50,005 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:50,005 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:51:50,005 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-23 14:51:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:51:50,008 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:50,009 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:51:50,009 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:51:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash 111860, now seen corresponding path program 1 times [2018-01-23 14:51:50,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:50,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:50,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:50,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:51:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:51:50,094 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:51:50,098 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:51:50,102 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:50,102 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:50,102 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:50,102 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:50,103 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:50,103 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:50,103 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:50,103 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:51:50,103 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-23 14:51:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-23 14:51:50,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:50,107 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,107 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:50,107 INFO L82 PathProgramCache]: Analyzing trace with hash 531101053, now seen corresponding path program 1 times [2018-01-23 14:51:50,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:50,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:50,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:50,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:50,131 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,163 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,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:50,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:51:50,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:51:50,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:51:50,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:51:50,179 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-01-23 14:51:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:50,259 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-01-23 14:51:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:51:50,260 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-23 14:51:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:50,268 INFO L225 Difference]: With dead ends: 58 [2018-01-23 14:51:50,268 INFO L226 Difference]: Without dead ends: 33 [2018-01-23 14:51:50,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:51:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-23 14:51:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-23 14:51:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-23 14:51:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-01-23 14:51:50,299 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 18 [2018-01-23 14:51:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:50,299 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-01-23 14:51:50,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:51:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-01-23 14:51:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-23 14:51:50,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:50,300 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:50,301 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash 403826474, now seen corresponding path program 1 times [2018-01-23 14:51:50,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:50,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:50,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:50,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:50,326 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,408 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,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:50,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:51:50,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:51:50,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:51:50,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:51:50,411 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 5 states. [2018-01-23 14:51:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:50,565 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-23 14:51:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:51:50,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-23 14:51:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:50,567 INFO L225 Difference]: With dead ends: 57 [2018-01-23 14:51:50,567 INFO L226 Difference]: Without dead ends: 52 [2018-01-23 14:51:50,568 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:51:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-23 14:51:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2018-01-23 14:51:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-23 14:51:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-01-23 14:51:50,575 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 21 [2018-01-23 14:51:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:50,575 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-01-23 14:51:50,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:51:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-01-23 14:51:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-23 14:51:50,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:50,576 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:50,576 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:50,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1062535480, now seen corresponding path program 1 times [2018-01-23 14:51:50,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:50,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:50,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:50,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:50,595 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,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:51:50,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:50,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:51:50,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:51:50,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:51:50,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:51:50,657 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 4 states. [2018-01-23 14:51:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:50,694 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-01-23 14:51:50,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:51:50,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-23 14:51:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:50,696 INFO L225 Difference]: With dead ends: 56 [2018-01-23 14:51:50,696 INFO L226 Difference]: Without dead ends: 40 [2018-01-23 14:51:50,696 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:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-23 14:51:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-23 14:51:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-23 14:51:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-23 14:51:50,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 27 [2018-01-23 14:51:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:50,703 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-23 14:51:50,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:51:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-23 14:51:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:51:50,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:50,704 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:50,705 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash -571757697, now seen corresponding path program 1 times [2018-01-23 14:51:50,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:50,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:50,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:50,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:50,729 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,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:51:50,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:50,857 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:50,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:50,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:50,926 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= (store |c_old(#valid)| |main_#t~malloc0.base| 1) |c_#valid|))) is different from true [2018-01-23 14:51:50,944 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int) (|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc3.base| 1)))) is different from true [2018-01-23 14:51:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2018-01-23 14:51:51,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:51,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-01-23 14:51:51,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:51:51,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:51:51,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2018-01-23 14:51:51,028 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 8 states. [2018-01-23 14:51:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:51,175 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-01-23 14:51:51,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:51:51,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-23 14:51:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:51,177 INFO L225 Difference]: With dead ends: 66 [2018-01-23 14:51:51,177 INFO L226 Difference]: Without dead ends: 50 [2018-01-23 14:51:51,177 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=38, Unknown=3, NotChecked=26, Total=90 [2018-01-23 14:51:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-23 14:51:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-01-23 14:51:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-23 14:51:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-23 14:51:51,183 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 37 [2018-01-23 14:51:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:51,183 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-23 14:51:51,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:51:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-23 14:51:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:51:51,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:51,185 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, 1] [2018-01-23 14:51:51,185 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:51,185 INFO L82 PathProgramCache]: Analyzing trace with hash -484218618, now seen corresponding path program 2 times [2018-01-23 14:51:51,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:51,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:51,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:51,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:51,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:51,210 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:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:51:51,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:51,420 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:51,432 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:51:51,453 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:51:51,467 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:51:51,471 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:51:51,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:51,481 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= (store |c_old(#valid)| |main_#t~malloc0.base| 1) |c_#valid|))) is different from true [2018-01-23 14:51:51,498 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int) (|main_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= (select .cse0 |main_#t~malloc3.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= |c_#valid| (store .cse0 |main_#t~malloc3.base| 1))))) is different from true [2018-01-23 14:51:51,547 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int) (|main_#t~malloc0.base| Int) (v_prenex_1 Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (let ((.cse0 (store .cse1 v_prenex_1 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc3.base| 1)) (= (select .cse1 v_prenex_1) 0) (= 0 (select .cse0 |main_#t~malloc3.base|)) (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0))))) is different from true [2018-01-23 14:51:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 16 not checked. [2018-01-23 14:51:51,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:51,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-01-23 14:51:51,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:51:51,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:51:51,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=41, Unknown=3, NotChecked=42, Total=110 [2018-01-23 14:51:51,664 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2018-01-23 14:51:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:51,913 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-01-23 14:51:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:51:51,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-23 14:51:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:51,917 INFO L225 Difference]: With dead ends: 122 [2018-01-23 14:51:51,918 INFO L226 Difference]: Without dead ends: 80 [2018-01-23 14:51:51,918 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=78, Unknown=4, NotChecked=60, Total=182 [2018-01-23 14:51:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-23 14:51:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-01-23 14:51:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-23 14:51:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-01-23 14:51:51,927 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 47 [2018-01-23 14:51:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:51,928 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-01-23 14:51:51,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:51:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-01-23 14:51:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-23 14:51:51,931 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:51,931 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 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:51,932 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1868461339, now seen corresponding path program 3 times [2018-01-23 14:51:51,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:51,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:51,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:51,934 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:51:51,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:51,976 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:53,632 WARN L146 SmtUtils]: Spent 350ms on a formula simplification. DAG size of input: 61 DAG size of output 46 [2018-01-23 14:51:53,979 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 61 DAG size of output 46 [2018-01-23 14:51:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:51:54,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:54,809 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:54,817 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:51:54,832 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:54,838 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:54,853 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:54,946 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:55,068 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:55,244 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:51:55,248 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:51:55,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:55,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:55,629 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:55,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:55,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:55,681 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:55,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:53 [2018-01-23 14:51:55,760 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:55,763 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:55,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:55,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:55,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:55,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:41 [2018-01-23 14:51:56,036 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:56,040 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:56,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:56,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:56,056 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:56,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2018-01-23 14:51:56,134 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:56,140 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:56,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:56,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:56,157 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:56,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:85, output treesize:64 [2018-01-23 14:51:56,309 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (main_~p~6.base Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse1 (store (store (store (store |c_old(#valid)| main_~p~6.base 1) v_prenex_2 1) v_prenex_3 1) v_prenex_4 1))) (let ((.cse0 (store .cse1 v_subst_1 1))) (and (= 0 (select .cse0 v_subst_2)) (= (select |c_old(#valid)| main_~p~6.base) 0) (= |c_#valid| (store .cse0 v_subst_2 1)) (= 0 (select .cse1 v_subst_1)))))) is different from true [2018-01-23 14:51:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 26 refuted. 89 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:51:56,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:56,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-01-23 14:51:56,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-23 14:51:56,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-23 14:51:56,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=468, Unknown=52, NotChecked=50, Total=756 [2018-01-23 14:51:56,381 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 28 states. [2018-01-23 14:51:59,723 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 86 DAG size of output 62 [2018-01-23 14:51:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:59,935 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-01-23 14:51:59,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-23 14:51:59,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 77 [2018-01-23 14:51:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:59,936 INFO L225 Difference]: With dead ends: 108 [2018-01-23 14:51:59,936 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:51:59,937 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 81 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=457, Invalid=1404, Unknown=213, NotChecked=88, Total=2162 [2018-01-23 14:51:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:51:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:51:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:51:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:51:59,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-01-23 14:51:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:59,938 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:51:59,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-23 14:51:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:51:59,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:51:59,940 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:59,940 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:59,940 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:59,940 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:59,940 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:59,940 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:59,940 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:59,940 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:51:59,940 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-23 14:51:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-23 14:51:59,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:59,942 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:59,942 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:51:59,942 INFO L82 PathProgramCache]: Analyzing trace with hash 398317574, now seen corresponding path program 1 times [2018-01-23 14:51:59,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:59,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:59,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:59,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:59,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:59,947 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:59,951 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:59,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:59,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:51:59,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:51:59,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:51:59,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:51:59,953 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-01-23 14:51:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:59,956 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-01-23 14:51:59,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:51:59,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-23 14:51:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:59,957 INFO L225 Difference]: With dead ends: 58 [2018-01-23 14:51:59,957 INFO L226 Difference]: Without dead ends: 31 [2018-01-23 14:51:59,957 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:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-23 14:51:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-23 14:51:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-23 14:51:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-23 14:51:59,961 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 16 [2018-01-23 14:51:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:59,961 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-23 14:51:59,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:51:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-23 14:51:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:51:59,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:59,962 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:59,962 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:51:59,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1734496499, now seen corresponding path program 1 times [2018-01-23 14:51:59,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:59,963 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:59,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:59,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:59,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:59,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:00,000 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:52:00,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:00,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:52:00,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:52:00,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:52:00,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:52:00,002 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-01-23 14:52:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:00,055 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-01-23 14:52:00,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:52:00,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-23 14:52:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:00,057 INFO L225 Difference]: With dead ends: 53 [2018-01-23 14:52:00,057 INFO L226 Difference]: Without dead ends: 50 [2018-01-23 14:52:00,057 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:52:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-23 14:52:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2018-01-23 14:52:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-23 14:52:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-01-23 14:52:00,061 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 19 [2018-01-23 14:52:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:00,062 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-01-23 14:52:00,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:52:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-01-23 14:52:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:52:00,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:00,063 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:52:00,063 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash 86021761, now seen corresponding path program 1 times [2018-01-23 14:52:00,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:00,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:00,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:00,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:00,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:52:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:52:00,082 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:52:00,086 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:52:00,090 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:52:00,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:52:00 BoogieIcfgContainer [2018-01-23 14:52:00,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:52:00,103 INFO L168 Benchmark]: Toolchain (without parser) took 10759.62 ms. Allocated memory was 304.1 MB in the beginning and 742.4 MB in the end (delta: 438.3 MB). Free memory was 261.4 MB in the beginning and 613.2 MB in the end (delta: -351.8 MB). Peak memory consumption was 86.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,105 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.1 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:52:00,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.97 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,105 INFO L168 Benchmark]: Boogie Preprocessor took 33.13 ms. Allocated memory is still 304.1 MB. Free memory was 251.4 MB in the beginning and 249.4 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:52:00,106 INFO L168 Benchmark]: RCFGBuilder took 229.42 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 232.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,106 INFO L168 Benchmark]: TraceAbstraction took 10279.34 ms. Allocated memory was 304.1 MB in the beginning and 742.4 MB in the end (delta: 438.3 MB). Free memory was 230.9 MB in the beginning and 613.2 MB in the end (delta: -382.3 MB). Peak memory consumption was 56.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,108 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 304.1 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.97 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.13 ms. Allocated memory is still 304.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 229.42 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 232.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10279.34 ms. Allocated memory was 304.1 MB in the beginning and 742.4 MB in the end (delta: 438.3 MB). Free memory was 230.9 MB in the beginning and 613.2 MB in the end (delta: -382.3 MB). Peak memory consumption was 56.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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, 44 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=41occurred 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, 9 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 9 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 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, 44 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=41occurred 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, 44 locations, 4 error locations. SAFE Result, 9.8s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 219 SDtfs, 352 SDslu, 809 SDs, 0 SdLazy, 699 SolverSat, 51 SolverUnsat, 223 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 169 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=5, 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, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 379 ConstructedInterpolants, 129 QuantifiedInterpolants, 2330697 SizeOfPredicates, 28 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 14/282 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] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={10:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L628] COND FALSE !(a == 0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L629] List t; [L630] List p = a; VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] FCALL p->h = 1 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L639] FCALL p->n = 0 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L640] p = a VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L641] COND TRUE p!=0 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L642] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=1] [L642] COND FALSE !(p->h != 1) [L645] EXPR, FCALL p->n VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->n={0:0}] [L645] p = p->n [L641] COND FALSE !(p!=0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 93 SDslu, 28 SDs, 0 SdLazy, 25 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 2 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 1143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: 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/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-52-00-118.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-52-00-118.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-52-00-118.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-52-00-118.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-52-00-118.csv Received shutdown request...