java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:34:38,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:34:38,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:34:38,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:34:38,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:34:38,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:34:38,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:34:38,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:34:38,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:34:38,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:34:38,459 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:34:38,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:34:38,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:34:38,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:34:38,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:34:38,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:34:38,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:34:38,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:34:38,471 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:34:38,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:34:38,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:34:38,476 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:34:38,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:34:38,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:34:38,478 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:34:38,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:34:38,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:34:38,480 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:34:38,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:34:38,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:34:38,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:34:38,481 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:34:38,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:34:38,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:34:38,493 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:34:38,493 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:34:38,493 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:34:38,493 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:34:38,494 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:34:38,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:34:38,495 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:34:38,495 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:34:38,495 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:34:38,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:34:38,495 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:34:38,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:34:38,496 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:34:38,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:34:38,496 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:34:38,496 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:34:38,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:34:38,497 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:34:38,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:34:38,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:34:38,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:34:38,497 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:34:38,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:34:38,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:34:38,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:34:38,498 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:34:38,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:34:38,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:34:38,499 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:34:38,499 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:34:38,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:34:38,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:34:38,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:34:38,501 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:34:38,501 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:34:38,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:34:38,551 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:34:38,555 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:34:38,557 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:34:38,557 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:34:38,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-23 14:34:38,757 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:34:38,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:34:38,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:34:38,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:34:38,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:34:38,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:34:38" (1/1) ... [2018-01-23 14:34:38,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f9b563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:38, skipping insertion in model container [2018-01-23 14:34:38,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:34:38" (1/1) ... [2018-01-23 14:34:38,795 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:34:38,836 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:34:38,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:34:39,004 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:34:39,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39 WrapperNode [2018-01-23 14:34:39,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:34:39,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:34:39,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:34:39,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:34:39,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (1/1) ... [2018-01-23 14:34:39,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (1/1) ... [2018-01-23 14:34:39,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (1/1) ... [2018-01-23 14:34:39,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (1/1) ... [2018-01-23 14:34:39,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (1/1) ... [2018-01-23 14:34:39,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (1/1) ... [2018-01-23 14:34:39,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (1/1) ... [2018-01-23 14:34:39,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:34:39,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:34:39,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:34:39,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:34:39,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:34:39,097 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:34:39,097 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:34:39,097 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-23 14:34:39,097 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:34:39,097 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:34:39,097 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:34:39,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:34:39,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:34:39,098 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:34:39,098 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:34:39,098 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:34:39,098 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:34:39,098 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-23 14:34:39,098 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:34:39,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:34:39,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:34:39,297 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:34:39,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:34:39 BoogieIcfgContainer [2018-01-23 14:34:39,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:34:39,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:34:39,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:34:39,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:34:39,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:34:38" (1/3) ... [2018-01-23 14:34:39,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bff38ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:34:39, skipping insertion in model container [2018-01-23 14:34:39,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:39" (2/3) ... [2018-01-23 14:34:39,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bff38ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:34:39, skipping insertion in model container [2018-01-23 14:34:39,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:34:39" (3/3) ... [2018-01-23 14:34:39,304 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-23 14:34:39,310 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:34:39,316 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-23 14:34:39,365 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:39,365 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:39,365 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:39,365 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:39,365 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:39,366 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:39,366 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:39,366 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:34:39,367 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-23 14:34:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:34:39,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:39,395 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:34:39,395 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:34:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash 104751, now seen corresponding path program 1 times [2018-01-23 14:34:39,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:39,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:39,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:39,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:39,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:34:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:34:39,545 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:34:39,553 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:39,562 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:39,562 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:39,562 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:39,562 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:39,562 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:39,562 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:39,562 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:39,562 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-23 14:34:39,562 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-23 14:34:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:34:39,565 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:39,565 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:39,565 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-23 14:34:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash -387558155, now seen corresponding path program 1 times [2018-01-23 14:34:39,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:39,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:39,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:39,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:39,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:39,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:39,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:39,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:34:39,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:34:39,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:34:39,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:39,646 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-23 14:34:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:39,670 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-23 14:34:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:34:39,741 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-23 14:34:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:39,750 INFO L225 Difference]: With dead ends: 77 [2018-01-23 14:34:39,751 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:34:39,755 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:34:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:34:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:34:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:34:39,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-23 14:34:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:39,777 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:34:39,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:34:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:34:39,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:34:39,780 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:39,781 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:39,781 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:39,781 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:39,781 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:39,781 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:39,781 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:39,781 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:34:39,782 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-23 14:34:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-23 14:34:39,785 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:39,786 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:39,786 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:39,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1865714460, now seen corresponding path program 1 times [2018-01-23 14:34:39,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:39,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:39,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:39,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:39,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:39,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:39,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:39,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:34:39,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:34:39,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:34:39,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:39,829 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-23 14:34:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:39,835 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-23 14:34:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:34:39,835 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-23 14:34:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:39,837 INFO L225 Difference]: With dead ends: 77 [2018-01-23 14:34:39,838 INFO L226 Difference]: Without dead ends: 40 [2018-01-23 14:34:39,838 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:39,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-23 14:34:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-23 14:34:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-23 14:34:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-23 14:34:39,850 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 29 [2018-01-23 14:34:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:39,851 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-23 14:34:39,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:34:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-23 14:34:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-23 14:34:39,852 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:39,852 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:39,852 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash -880196222, now seen corresponding path program 1 times [2018-01-23 14:34:39,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:39,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:39,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:39,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:39,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:39,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:40,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:40,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:34:40,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:34:40,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:34:40,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:34:40,016 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-23 14:34:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:40,119 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-01-23 14:34:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:34:40,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-23 14:34:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:40,122 INFO L225 Difference]: With dead ends: 45 [2018-01-23 14:34:40,122 INFO L226 Difference]: Without dead ends: 38 [2018-01-23 14:34:40,123 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:34:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-23 14:34:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-23 14:34:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-23 14:34:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-23 14:34:40,130 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2018-01-23 14:34:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:40,130 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-23 14:34:40,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:34:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-23 14:34:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-23 14:34:40,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:40,132 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:40,132 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1506938106, now seen corresponding path program 1 times [2018-01-23 14:34:40,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:40,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:40,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:40,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:40,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:40,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:40,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:34:40,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:34:40,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:34:40,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:34:40,212 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-23 14:34:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:40,298 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-23 14:34:40,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:34:40,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-23 14:34:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:40,303 INFO L225 Difference]: With dead ends: 65 [2018-01-23 14:34:40,303 INFO L226 Difference]: Without dead ends: 48 [2018-01-23 14:34:40,303 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:34:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-23 14:34:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-01-23 14:34:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-23 14:34:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-23 14:34:40,310 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-01-23 14:34:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:40,310 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-23 14:34:40,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:34:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-23 14:34:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:34:40,312 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:40,312 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:40,312 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1981787469, now seen corresponding path program 1 times [2018-01-23 14:34:40,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:40,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:40,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:40,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:34:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:34:40,373 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:34:40,384 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:40,389 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:40,392 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:40,392 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:40,405 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:40,405 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:40,405 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:40,405 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:40,405 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:40,405 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:40,405 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:40,406 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:34:40,406 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-23 14:34:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-23 14:34:40,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:40,408 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:40,408 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1942190490, now seen corresponding path program 1 times [2018-01-23 14:34:40,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:40,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:40,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:40,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:40,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:40,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:40,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:34:40,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:34:40,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:34:40,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:40,427 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-23 14:34:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:40,431 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-23 14:34:40,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:34:40,431 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-23 14:34:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:40,432 INFO L225 Difference]: With dead ends: 77 [2018-01-23 14:34:40,432 INFO L226 Difference]: Without dead ends: 38 [2018-01-23 14:34:40,432 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-23 14:34:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-23 14:34:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-23 14:34:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-23 14:34:40,435 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2018-01-23 14:34:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:40,435 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-23 14:34:40,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:34:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-23 14:34:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-23 14:34:40,436 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:40,436 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:40,436 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash -215440820, now seen corresponding path program 1 times [2018-01-23 14:34:40,437 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:40,437 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:40,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:40,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:40,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:40,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:40,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:34:40,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:34:40,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:34:40,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:34:40,499 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-23 14:34:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:40,561 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-23 14:34:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:34:40,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-23 14:34:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:40,563 INFO L225 Difference]: With dead ends: 41 [2018-01-23 14:34:40,563 INFO L226 Difference]: Without dead ends: 36 [2018-01-23 14:34:40,563 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:34:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-23 14:34:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-23 14:34:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-23 14:34:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-23 14:34:40,567 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2018-01-23 14:34:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:40,568 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-23 14:34:40,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:34:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-23 14:34:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-23 14:34:40,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:40,568 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:40,569 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash -211623728, now seen corresponding path program 1 times [2018-01-23 14:34:40,569 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:40,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:40,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:40,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:40,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:40,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:40,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:34:40,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:34:40,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:34:40,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:34:40,621 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-23 14:34:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:40,725 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-23 14:34:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:34:40,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-23 14:34:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:40,727 INFO L225 Difference]: With dead ends: 61 [2018-01-23 14:34:40,727 INFO L226 Difference]: Without dead ends: 46 [2018-01-23 14:34:40,727 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:34:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-23 14:34:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-01-23 14:34:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-23 14:34:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-23 14:34:40,731 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-01-23 14:34:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:40,731 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-23 14:34:40,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:34:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-23 14:34:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-23 14:34:40,732 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:40,732 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:40,732 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1396474071, now seen corresponding path program 1 times [2018-01-23 14:34:40,733 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:40,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:40,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:40,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:40,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:34:41,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:41,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-23 14:34:41,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:34:41,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:34:41,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:34:41,223 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 9 states. [2018-01-23 14:34:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:41,546 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-01-23 14:34:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:34:41,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-23 14:34:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:41,546 INFO L225 Difference]: With dead ends: 38 [2018-01-23 14:34:41,546 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:34:41,547 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:34:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:34:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:34:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:34:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:34:41,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-23 14:34:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:41,548 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:34:41,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:34:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:34:41,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:34:41,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:34:41 BoogieIcfgContainer [2018-01-23 14:34:41,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:34:41,552 INFO L168 Benchmark]: Toolchain (without parser) took 2793.63 ms. Allocated memory was 305.7 MB in the beginning and 480.2 MB in the end (delta: 174.6 MB). Free memory was 263.0 MB in the beginning and 391.4 MB in the end (delta: -128.4 MB). Peak memory consumption was 46.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:41,553 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:34:41,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.53 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 253.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:41,553 INFO L168 Benchmark]: Boogie Preprocessor took 34.25 ms. Allocated memory is still 305.7 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:41,554 INFO L168 Benchmark]: RCFGBuilder took 250.84 ms. Allocated memory is still 305.7 MB. Free memory was 251.0 MB in the beginning and 234.5 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:41,554 INFO L168 Benchmark]: TraceAbstraction took 2252.16 ms. Allocated memory was 305.7 MB in the beginning and 480.2 MB in the end (delta: 174.6 MB). Free memory was 234.5 MB in the beginning and 391.4 MB in the end (delta: -156.9 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:41,556 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.18 ms. Allocated memory is still 305.7 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 248.53 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 253.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.25 ms. Allocated memory is still 305.7 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 250.84 ms. Allocated memory is still 305.7 MB. Free memory was 251.0 MB in the beginning and 234.5 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2252.16 ms. Allocated memory was 305.7 MB in the beginning and 480.2 MB in the end (delta: 174.6 MB). Free memory was 234.5 MB in the beginning and 391.4 MB in the end (delta: -156.9 MB). Peak memory consumption was 17.7 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=7, \old(a)=4, \old(b)=3, \old(b)=2, \old(n)=5, a={0:0}, b={0:0}, n=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.2s 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=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 622]: 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: fooErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L636] a = malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc (n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L639] CALL foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[n - 2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, b[n - 2]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L643] FCALL free(b-1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L644] return 0; VAL [a={7:0}, b={13:4}, n=1] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 74 SDslu, 114 SDs, 0 SdLazy, 67 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 4688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 630]: 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 4 procedures, 44 locations, 4 error locations. SAFE Result, 1.1s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 97 SDslu, 149 SDs, 0 SdLazy, 239 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 14824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-34-41-566.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-34-41-566.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-34-41-566.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-34-41-566.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-34-41-566.csv Received shutdown request...