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/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:21:52,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:21:52,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:21:52,415 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:21:52,415 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:21:52,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:21:52,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:21:52,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:21:52,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:21:52,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:21:52,422 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:21:52,422 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:21:52,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:21:52,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:21:52,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:21:52,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:21:52,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:21:52,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:21:52,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:21:52,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:21:52,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:21:52,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:21:52,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:21:52,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:21:52,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:21:52,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:21:52,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:21:52,441 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:21:52,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:21:52,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:21:52,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:21:52,442 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-20 22:21:52,452 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:21:52,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:21:52,453 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:21:52,454 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:21:52,454 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:21:52,454 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:21:52,454 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:21:52,455 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:21:52,455 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:21:52,455 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:21:52,455 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:21:52,456 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:21:52,456 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:21:52,456 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:21:52,456 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:21:52,456 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:21:52,457 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:21:52,457 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:21:52,457 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:21:52,457 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:21:52,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:21:52,458 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:21:52,458 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:21:52,458 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:21:52,458 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:21:52,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:21:52,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:21:52,459 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:21:52,459 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:21:52,459 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:21:52,459 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:21:52,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:21:52,460 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:21:52,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:21:52,460 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:21:52,461 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:21:52,461 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:21:52,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:21:52,508 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:21:52,512 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:21:52,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:21:52,514 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:21:52,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i [2018-01-20 22:21:52,700 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:21:52,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:21:52,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:21:52,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:21:52,711 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:21:52,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52, skipping insertion in model container [2018-01-20 22:21:52,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,729 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:21:52,777 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:21:52,894 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:21:52,916 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:21:52,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52 WrapperNode [2018-01-20 22:21:52,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:21:52,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:21:52,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:21:52,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:21:52,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (1/1) ... [2018-01-20 22:21:52,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:21:52,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:21:52,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:21:52,967 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:21:52,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:21:53,037 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:21:53,037 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:21:53,038 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 22:21:53,038 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-01-20 22:21:53,038 INFO L136 BoogieDeclarations]: Found implementation of procedure free_10 [2018-01-20 22:21:53,038 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 22:21:53,038 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:21:53,038 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:21:53,039 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:21:53,039 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:21:53,039 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:21:53,039 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:21:53,039 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:21:53,039 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:21:53,039 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:21:53,040 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 22:21:53,040 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-01-20 22:21:53,040 INFO L128 BoogieDeclarations]: Found specification of procedure free_10 [2018-01-20 22:21:53,040 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 22:21:53,040 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:21:53,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:21:53,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:21:53,332 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:21:53,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:21:53 BoogieIcfgContainer [2018-01-20 22:21:53,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:21:53,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:21:53,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:21:53,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:21:53,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:21:52" (1/3) ... [2018-01-20 22:21:53,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2d479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:21:53, skipping insertion in model container [2018-01-20 22:21:53,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:21:52" (2/3) ... [2018-01-20 22:21:53,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2d479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:21:53, skipping insertion in model container [2018-01-20 22:21:53,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:21:53" (3/3) ... [2018-01-20 22:21:53,339 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test10_true-valid-memsafety_true-termination.i [2018-01-20 22:21:53,345 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:21:53,351 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-20 22:21:53,395 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:53,396 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:53,396 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:53,396 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:53,396 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:53,396 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:53,396 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:53,397 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_10Err0EnsuresViolation======== [2018-01-20 22:21:53,398 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:21:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 22:21:53,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:53,430 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:53,430 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_10Err0EnsuresViolation]=== [2018-01-20 22:21:53,434 INFO L82 PathProgramCache]: Analyzing trace with hash 969405430, now seen corresponding path program 1 times [2018-01-20 22:21:53,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:53,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:53,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:53,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:53,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:53,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-20 22:21:53,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:21:53,753 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-20 22:21:53,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:53,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:21:54,048 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 11 treesize of output 8 [2018-01-20 22:21:54,051 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 8 treesize of output 7 [2018-01-20 22:21:54,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,069 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 11 treesize of output 8 [2018-01-20 22:21:54,071 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 8 treesize of output 7 [2018-01-20 22:21:54,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-20 22:21:54,244 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-01-20 22:21:54,254 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-01-20 22:21:54,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,284 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,285 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 42 [2018-01-20 22:21:54,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2018-01-20 22:21:54,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:21 [2018-01-20 22:21:54,599 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,600 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2018-01-20 22:21:54,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 53 [2018-01-20 22:21:54,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,646 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,646 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2018-01-20 22:21:54,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 18 [2018-01-20 22:21:54,651 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:21 [2018-01-20 22:21:54,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-20 22:21:54,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-01-20 22:21:54,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:25 [2018-01-20 22:21:54,783 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:21:54,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-01-20 22:21:54,790 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 11 treesize of output 3 [2018-01-20 22:21:54,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:21:54,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:7 [2018-01-20 22:21:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:21:54,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:21:54,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 22] total 23 [2018-01-20 22:21:54,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-20 22:21:54,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-20 22:21:54,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-01-20 22:21:54,885 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 23 states. [2018-01-20 22:21:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:55,726 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2018-01-20 22:21:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-20 22:21:55,728 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-01-20 22:21:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:55,737 INFO L225 Difference]: With dead ends: 135 [2018-01-20 22:21:55,737 INFO L226 Difference]: Without dead ends: 51 [2018-01-20 22:21:55,741 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2018-01-20 22:21:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-20 22:21:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-01-20 22:21:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-20 22:21:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-20 22:21:55,786 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 54 [2018-01-20 22:21:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:55,786 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-20 22:21:55,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-20 22:21:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-20 22:21:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-20 22:21:55,788 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:55,789 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:55,789 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_10Err0EnsuresViolation]=== [2018-01-20 22:21:55,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1942043624, now seen corresponding path program 1 times [2018-01-20 22:21:55,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:55,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:55,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:55,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:55,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:55,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:21:55,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:21:55,873 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-20 22:21:55,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:55,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:21:55,927 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:21:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-20 22:21:55,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:21:55,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:21:55,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:21:55,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:21:55,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 22:21:55,959 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 5 states. [2018-01-20 22:21:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:56,006 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-20 22:21:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:21:56,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-20 22:21:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:56,008 INFO L225 Difference]: With dead ends: 54 [2018-01-20 22:21:56,008 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:56,009 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-20 22:21:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:56,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-01-20 22:21:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:56,010 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:56,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:21:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:56,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:56,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:21:56,081 INFO L404 ceAbstractionStarter]: At program point free_10ENTRY(lines 1450 1452) the Hoare annotation is: true [2018-01-20 22:21:56,081 INFO L401 ceAbstractionStarter]: For program point L1451'''(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,081 INFO L401 ceAbstractionStarter]: For program point L1451'(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,081 INFO L401 ceAbstractionStarter]: For program point L1451''(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,081 INFO L401 ceAbstractionStarter]: For program point free_10FINAL(lines 1450 1452) no Hoare annotation was computed. [2018-01-20 22:21:56,081 INFO L401 ceAbstractionStarter]: For program point free_10EXIT(lines 1450 1452) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point free_10Err0EnsuresViolation(lines 1450 1452) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point L1451(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point L1451''''(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point L1447''''(line 1447) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point L1447(line 1447) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L404 ceAbstractionStarter]: At program point alloc_10ENTRY(lines 1446 1448) the Hoare annotation is: true [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point alloc_10FINAL(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point alloc_10Err0EnsuresViolation(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point L1447'''(line 1447) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-20 22:21:56,082 INFO L404 ceAbstractionStarter]: At program point L1447''(line 1447) the Hoare annotation is: true [2018-01-20 22:21:56,083 INFO L401 ceAbstractionStarter]: For program point alloc_10EXIT(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 22:21:56,083 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:56,083 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 22:21:56,083 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 22:21:56,083 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:56,083 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:56,083 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:56,083 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 22:21:56,084 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,084 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,084 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:56,084 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,084 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1474) the Hoare annotation is: true [2018-01-20 22:21:56,084 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,084 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1474) the Hoare annotation is: true [2018-01-20 22:21:56,084 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,084 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,085 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1472 1474) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-01-20 22:21:56,085 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,085 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,085 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,085 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-20 22:21:56,085 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-20 22:21:56,085 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 22:21:56,086 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-20 22:21:56,086 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-20 22:21:56,086 INFO L397 ceAbstractionStarter]: At program point L1459'(line 1459) the Hoare annotation is: false [2018-01-20 22:21:56,086 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1454 1470) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-01-20 22:21:56,086 INFO L401 ceAbstractionStarter]: For program point L1458(line 1458) no Hoare annotation was computed. [2018-01-20 22:21:56,086 INFO L401 ceAbstractionStarter]: For program point L1459(line 1459) no Hoare annotation was computed. [2018-01-20 22:21:56,086 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L397 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: false [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point L1457''(line 1457) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point L1459''(line 1459) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point L1465''(line 1465) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point L1460''(line 1460) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point L1460'(line 1460) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L397 ceAbstractionStarter]: At program point L1462'(line 1462) the Hoare annotation is: false [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point L1465(line 1465) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L404 ceAbstractionStarter]: At program point L1466(lines 1466 1467) the Hoare annotation is: true [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-20 22:21:56,087 INFO L397 ceAbstractionStarter]: At program point L1462(line 1462) the Hoare annotation is: false [2018-01-20 22:21:56,087 INFO L401 ceAbstractionStarter]: For program point L1458'(line 1458) no Hoare annotation was computed. [2018-01-20 22:21:56,088 INFO L401 ceAbstractionStarter]: For program point L1460(line 1460) no Hoare annotation was computed. [2018-01-20 22:21:56,088 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 22:21:56,088 INFO L401 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-01-20 22:21:56,088 INFO L404 ceAbstractionStarter]: At program point L1468(lines 1468 1469) the Hoare annotation is: true [2018-01-20 22:21:56,088 INFO L401 ceAbstractionStarter]: For program point L1459'''(line 1459) no Hoare annotation was computed. [2018-01-20 22:21:56,091 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:56,091 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:56,091 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:56,091 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:56,091 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:56,091 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:56,092 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:56,092 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_10Err0EnsuresViolation======== [2018-01-20 22:21:56,092 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:21:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-20 22:21:56,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:56,096 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:56,096 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_10Err0EnsuresViolation]=== [2018-01-20 22:21:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2031032569, now seen corresponding path program 1 times [2018-01-20 22:21:56,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:56,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:56,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:56,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-20 22:21:56,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:21:56,168 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-20 22:21:56,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:56,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:21:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:21:56,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:21:56,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-20 22:21:56,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:21:56,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:21:56,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:21:56,247 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 6 states. [2018-01-20 22:21:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:56,495 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2018-01-20 22:21:56,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:21:56,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-20 22:21:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:56,496 INFO L225 Difference]: With dead ends: 129 [2018-01-20 22:21:56,496 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:56,497 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:21:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:56,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-01-20 22:21:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:56,498 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:56,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:21:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:56,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:56,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:21:56,519 INFO L397 ceAbstractionStarter]: At program point free_10ENTRY(lines 1450 1452) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point L1451'''(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point L1451'(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point L1451''(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point free_10FINAL(lines 1450 1452) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point free_10EXIT(lines 1450 1452) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point free_10Err0EnsuresViolation(lines 1450 1452) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point L1451(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point L1451''''(line 1451) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point L1447''''(line 1447) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L401 ceAbstractionStarter]: For program point L1447(line 1447) no Hoare annotation was computed. [2018-01-20 22:21:56,519 INFO L397 ceAbstractionStarter]: At program point alloc_10ENTRY(lines 1446 1448) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point alloc_10FINAL(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point alloc_10Err0EnsuresViolation(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point L1447'''(line 1447) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L397 ceAbstractionStarter]: At program point L1447''(line 1447) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point alloc_10EXIT(lines 1446 1448) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:21:56,520 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1474) the Hoare annotation is: true [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1474) the Hoare annotation is: true [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1472 1474) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,521 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1472 1474) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L397 ceAbstractionStarter]: At program point L1459'(line 1459) the Hoare annotation is: false [2018-01-20 22:21:56,522 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1454 1470) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1458(line 1458) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1459(line 1459) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L397 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: false [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1457''(line 1457) no Hoare annotation was computed. [2018-01-20 22:21:56,522 INFO L401 ceAbstractionStarter]: For program point L1459''(line 1459) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point L1465''(line 1465) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point L1460''(line 1460) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point L1460'(line 1460) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L397 ceAbstractionStarter]: At program point L1462'(line 1462) the Hoare annotation is: false [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point L1465(line 1465) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L404 ceAbstractionStarter]: At program point L1466(lines 1466 1467) the Hoare annotation is: true [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L397 ceAbstractionStarter]: At program point L1462(line 1462) the Hoare annotation is: false [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point L1458'(line 1458) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point L1460(line 1460) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1454 1470) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L401 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-01-20 22:21:56,523 INFO L404 ceAbstractionStarter]: At program point L1468(lines 1468 1469) the Hoare annotation is: true [2018-01-20 22:21:56,524 INFO L401 ceAbstractionStarter]: For program point L1459'''(line 1459) no Hoare annotation was computed. [2018-01-20 22:21:56,525 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:56,525 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:56,525 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:56,525 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:56,525 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:56,525 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:56,525 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:56,525 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 22:21:56,525 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:21:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-20 22:21:56,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:56,527 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:56,527 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 22:21:56,527 INFO L82 PathProgramCache]: Analyzing trace with hash 169540191, now seen corresponding path program 1 times [2018-01-20 22:21:56,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:56,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:56,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:56,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:56,549 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-20 22:21:56,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:56,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:21:56,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:21:56,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:21:56,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:21:56,550 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 22:21:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:56,617 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-01-20 22:21:56,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:21:56,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-20 22:21:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:56,618 INFO L225 Difference]: With dead ends: 73 [2018-01-20 22:21:56,618 INFO L226 Difference]: Without dead ends: 34 [2018-01-20 22:21:56,618 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:21:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-20 22:21:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-20 22:21:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-20 22:21:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-20 22:21:56,622 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2018-01-20 22:21:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:56,623 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-20 22:21:56,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:21:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-20 22:21:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-20 22:21:56,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:56,623 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:56,623 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 22:21:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash -280726143, now seen corresponding path program 1 times [2018-01-20 22:21:56,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:56,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:56,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:56,662 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:21:56,668 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:56,670 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:56,680 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:56,680 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:56,680 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:56,680 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:56,680 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:56,680 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:56,680 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:56,680 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:21:56,680 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:21:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:21:56,681 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:56,682 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:21:56,682 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:21:56,682 INFO L82 PathProgramCache]: Analyzing trace with hash 106608, now seen corresponding path program 1 times [2018-01-20 22:21:56,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:56,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:56,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:56,688 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:21:56,689 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:56,691 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:56,691 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:56,691 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:56,692 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:56,692 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:56,692 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:56,692 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:56,692 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:21:56,692 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:21:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 22:21:56,694 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:56,694 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-20 22:21:56,695 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:21:56,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1654267771, now seen corresponding path program 1 times [2018-01-20 22:21:56,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:56,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:56,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:21:56,709 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:21:56,711 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:56,712 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:56,712 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:56,713 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:56,713 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:21:56,715 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:56,715 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:56,715 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:56,715 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:56,716 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:56,716 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:56,716 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:56,716 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:21:56,716 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:21:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 22:21:56,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:56,717 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:56,717 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:21:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1650881580, now seen corresponding path program 1 times [2018-01-20 22:21:56,718 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:56,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:56,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:56,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:56,763 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-20 22:21:56,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:56,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:21:56,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:21:56,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:21:56,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:21:56,764 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 22:21:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:56,810 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-01-20 22:21:56,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:21:56,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-20 22:21:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:56,810 INFO L225 Difference]: With dead ends: 73 [2018-01-20 22:21:56,810 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:56,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-20 22:21:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:56,812 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-01-20 22:21:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:56,812 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:56,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:21:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:56,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:56,813 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:21:56,813 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:21:56,813 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:21:56,813 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:21:56,813 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:21:56,813 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:21:56,813 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:21:56,813 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 22:21:56,813 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:21:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:21:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 22:21:56,815 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:56,815 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:21:56,815 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:21:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 895571633, now seen corresponding path program 1 times [2018-01-20 22:21:56,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:56,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:56,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:56,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:56,835 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-20 22:21:56,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:21:56,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:21:56,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:21:56,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:21:56,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:21:56,836 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 22:21:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:56,897 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-01-20 22:21:56,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:21:56,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-20 22:21:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:56,899 INFO L225 Difference]: With dead ends: 73 [2018-01-20 22:21:56,900 INFO L226 Difference]: Without dead ends: 59 [2018-01-20 22:21:56,900 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-20 22:21:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-20 22:21:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-20 22:21:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-20 22:21:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-20 22:21:56,908 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 14 [2018-01-20 22:21:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:56,909 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-20 22:21:56,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:21:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-20 22:21:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:21:56,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:56,910 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] [2018-01-20 22:21:56,910 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:21:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 474589827, now seen corresponding path program 1 times [2018-01-20 22:21:56,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:56,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:56,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:56,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:21:56,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:21:56,980 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-20 22:21:56,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:56,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:21:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:21:57,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:21:57,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-01-20 22:21:57,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:21:57,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:21:57,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:21:57,037 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 9 states. [2018-01-20 22:21:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:57,058 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-20 22:21:57,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:21:57,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-20 22:21:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:57,059 INFO L225 Difference]: With dead ends: 105 [2018-01-20 22:21:57,059 INFO L226 Difference]: Without dead ends: 57 [2018-01-20 22:21:57,060 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:21:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-20 22:21:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-20 22:21:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-20 22:21:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-20 22:21:57,065 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 24 [2018-01-20 22:21:57,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:57,065 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-20 22:21:57,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:21:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-20 22:21:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 22:21:57,066 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:21:57,066 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] [2018-01-20 22:21:57,066 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:21:57,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1595669979, now seen corresponding path program 1 times [2018-01-20 22:21:57,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:21:57,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:21:57,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:57,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:57,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:21:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:57,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:21:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:21:57,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:21:57,111 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-20 22:21:57,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:21:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:21:57,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:21:57,146 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:21:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-20 22:21:57,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:21:57,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:21:57,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:21:57,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:21:57,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 22:21:57,178 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2018-01-20 22:21:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:21:57,205 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-01-20 22:21:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:21:57,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-20 22:21:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:21:57,206 INFO L225 Difference]: With dead ends: 64 [2018-01-20 22:21:57,206 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:21:57,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-01-20 22:21:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:21:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:21:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:21:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:21:57,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-20 22:21:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:21:57,208 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:21:57,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:21:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:21:57,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:21:57,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:21:57 BoogieIcfgContainer [2018-01-20 22:21:57,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:21:57,211 INFO L168 Benchmark]: Toolchain (without parser) took 4510.93 ms. Allocated memory was 305.1 MB in the beginning and 514.9 MB in the end (delta: 209.7 MB). Free memory was 264.1 MB in the beginning and 314.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 158.8 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:57,213 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:21:57,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.67 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 251.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:57,213 INFO L168 Benchmark]: Boogie Preprocessor took 39.48 ms. Allocated memory is still 305.1 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:57,214 INFO L168 Benchmark]: RCFGBuilder took 366.55 ms. Allocated memory is still 305.1 MB. Free memory was 249.1 MB in the beginning and 228.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:57,214 INFO L168 Benchmark]: TraceAbstraction took 3876.64 ms. Allocated memory was 305.1 MB in the beginning and 514.9 MB in the end (delta: 209.7 MB). Free memory was 227.1 MB in the beginning and 314.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 121.9 MB. Max. memory is 5.3 GB. [2018-01-20 22:21:57,216 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.67 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 251.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.48 ms. Allocated memory is still 305.1 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 366.55 ms. Allocated memory is still 305.1 MB. Free memory was 249.1 MB in the beginning and 228.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3876.64 ms. Allocated memory was 305.1 MB in the beginning and 514.9 MB in the end (delta: 209.7 MB). Free memory was 227.1 MB in the beginning and 314.9 MB in the end (delta: -87.8 MB). Peak memory consumption was 121.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1450]: 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: free_10Err0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 2.7s OverallTime, 2 OverallIterations, 4 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 68 SDslu, 284 SDs, 0 SdLazy, 861 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 24 PreInvPairs, 28 NumberOfFragments, 37 HoareAnnotationTreeSize, 24 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 216 ConstructedInterpolants, 2 QuantifiedInterpolants, 63851 SizeOfPredicates, 28 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 74/96 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1446]: 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: alloc_10Err0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 4 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 29 SDslu, 151 SDs, 0 SdLazy, 94 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 24 PreInvPairs, 32 NumberOfFragments, 37 HoareAnnotationTreeSize, 24 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 5896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 179 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 42/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1473] CALL entry_point() [L1455] CALL ldv_malloc(sizeof(struct A10)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 32 SDslu, 5 SDs, 0 SdLazy, 30 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 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 - 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 7 procedures, 66 locations, 7 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=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1455] EXPR ldv_malloc(sizeof(struct A10)) VAL [ldv_malloc(sizeof(struct A10))={0:0}] [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND TRUE, RET !a10 VAL [a10={0:0}] [L1473] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 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=66occurred 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, 18 NumberOfCodeBlocks, 18 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: 1472]: 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: mainErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 28 SDslu, 5 SDs, 0 SdLazy, 30 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 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 - PositiveResult [Line: 1454]: 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: entry_pointErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 31 SDslu, 337 SDs, 0 SdLazy, 76 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 109 ConstructedInterpolants, 2 QuantifiedInterpolants, 4885 SizeOfPredicates, 4 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 8/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 1466]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1468]: 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/memleaks_test10_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-21-57-228.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-21-57-228.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-21-57-228.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-21-57-228.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-21-57-228.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_22-21-57-228.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_22-21-57-228.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_22-21-57-228.csv Received shutdown request...