java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 02:48:21,398 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 02:48:21,400 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 02:48:21,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 02:48:21,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 02:48:21,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 02:48:21,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 02:48:21,420 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 02:48:21,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 02:48:21,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 02:48:21,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 02:48:21,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 02:48:21,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 02:48:21,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 02:48:21,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 02:48:21,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 02:48:21,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 02:48:21,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 02:48:21,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 02:48:21,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 02:48:21,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 02:48:21,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 02:48:21,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 02:48:21,442 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 02:48:21,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 02:48:21,444 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 02:48:21,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 02:48:21,445 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 02:48:21,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 02:48:21,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 02:48:21,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 02:48:21,447 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-21 02:48:21,456 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 02:48:21,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 02:48:21,457 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 02:48:21,457 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 02:48:21,457 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 02:48:21,457 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 02:48:21,458 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 02:48:21,458 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 02:48:21,458 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 02:48:21,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 02:48:21,458 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 02:48:21,459 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 02:48:21,459 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 02:48:21,459 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 02:48:21,459 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 02:48:21,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 02:48:21,459 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 02:48:21,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 02:48:21,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 02:48:21,460 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 02:48:21,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 02:48:21,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 02:48:21,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 02:48:21,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 02:48:21,461 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 02:48:21,461 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 02:48:21,461 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 02:48:21,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 02:48:21,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 02:48:21,461 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 02:48:21,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 02:48:21,462 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 02:48:21,462 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 02:48:21,462 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 02:48:21,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 02:48:21,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 02:48:21,462 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 02:48:21,462 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 02:48:21,463 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 02:48:21,463 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 02:48:21,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 02:48:21,508 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 02:48:21,512 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 02:48:21,514 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 02:48:21,514 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 02:48:21,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-21 02:48:21,686 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 02:48:21,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 02:48:21,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 02:48:21,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 02:48:21,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 02:48:21,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533d743e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21, skipping insertion in model container [2018-01-21 02:48:21,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,713 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 02:48:21,751 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 02:48:21,872 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 02:48:21,890 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 02:48:21,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21 WrapperNode [2018-01-21 02:48:21,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 02:48:21,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 02:48:21,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 02:48:21,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 02:48:21,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (1/1) ... [2018-01-21 02:48:21,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 02:48:21,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 02:48:21,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 02:48:21,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 02:48:21,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 02:48:21,986 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 02:48:21,987 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 02:48:21,987 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 02:48:21,987 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 02:48:21,987 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 02:48:21,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 02:48:21,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 02:48:21,987 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 02:48:21,988 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 02:48:21,988 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 02:48:21,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 02:48:21,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 02:48:22,204 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 02:48:22,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 02:48:22 BoogieIcfgContainer [2018-01-21 02:48:22,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 02:48:22,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 02:48:22,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 02:48:22,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 02:48:22,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 02:48:21" (1/3) ... [2018-01-21 02:48:22,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da6ea56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 02:48:22, skipping insertion in model container [2018-01-21 02:48:22,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:21" (2/3) ... [2018-01-21 02:48:22,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da6ea56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 02:48:22, skipping insertion in model container [2018-01-21 02:48:22,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 02:48:22" (3/3) ... [2018-01-21 02:48:22,240 INFO L105 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-21 02:48:22,246 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 02:48:22,252 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 02:48:22,288 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:48:22,288 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:48:22,288 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:48:22,288 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:48:22,288 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:48:22,289 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:48:22,289 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:48:22,289 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 02:48:22,289 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:48:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 02:48:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 02:48:22,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:22,330 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 02:48:22,330 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 02:48:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash 106673, now seen corresponding path program 1 times [2018-01-21 02:48:22,338 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:22,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:22,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:22,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:22,381 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:48:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:48:22,447 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 02:48:22,453 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:22,461 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:48:22,461 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:48:22,461 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:48:22,461 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:48:22,461 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:48:22,462 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:48:22,462 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:48:22,462 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 02:48:22,462 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:48:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 02:48:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 02:48:22,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:22,466 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:48:22,466 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:48:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1701202051, now seen corresponding path program 1 times [2018-01-21 02:48:22,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:22,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:22,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:22,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:22,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:22,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:48:22,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:22,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 02:48:22,590 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:22,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:48:22,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:48:22,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:22,606 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-01-21 02:48:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:22,739 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-01-21 02:48:22,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:48:22,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-21 02:48:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:22,750 INFO L225 Difference]: With dead ends: 58 [2018-01-21 02:48:22,750 INFO L226 Difference]: Without dead ends: 33 [2018-01-21 02:48:22,753 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 02:48:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-21 02:48:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-21 02:48:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-21 02:48:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-01-21 02:48:22,793 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-01-21 02:48:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:22,793 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-01-21 02:48:22,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:48:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-01-21 02:48:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 02:48:22,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:22,795 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:48:22,795 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:48:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash 83400416, now seen corresponding path program 1 times [2018-01-21 02:48:22,795 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:22,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:22,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:22,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:22,796 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:22,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:48:22,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:22,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 02:48:22,914 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:22,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:48:22,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:48:22,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:22,917 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-01-21 02:48:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:22,980 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-01-21 02:48:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 02:48:22,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-21 02:48:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:22,984 INFO L225 Difference]: With dead ends: 56 [2018-01-21 02:48:22,984 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 02:48:22,985 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 02:48:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-01-21 02:48:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-21 02:48:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-21 02:48:22,993 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-01-21 02:48:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:22,994 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-21 02:48:22,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:48:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-21 02:48:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 02:48:22,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:22,995 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] [2018-01-21 02:48:22,995 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:48:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2028475934, now seen corresponding path program 1 times [2018-01-21 02:48:22,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:22,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:22,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:22,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:22,997 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:23,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:23,127 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-21 02:48:23,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:23,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 02:48:23,128 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:23,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:48:23,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:48:23,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:23,129 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-01-21 02:48:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:23,248 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-21 02:48:23,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 02:48:23,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-21 02:48:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:23,251 INFO L225 Difference]: With dead ends: 52 [2018-01-21 02:48:23,251 INFO L226 Difference]: Without dead ends: 45 [2018-01-21 02:48:23,251 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-21 02:48:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-01-21 02:48:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-21 02:48:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-21 02:48:23,258 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2018-01-21 02:48:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:23,259 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-21 02:48:23,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:48:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-21 02:48:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 02:48:23,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:23,260 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:48:23,260 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:48:23,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1502089971, now seen corresponding path program 1 times [2018-01-21 02:48:23,261 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:23,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:23,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:48:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:48:23,308 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 02:48:23,315 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:23,320 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:23,320 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:23,335 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:48:23,335 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:48:23,336 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:48:23,336 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:48:23,336 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:48:23,336 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:48:23,336 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:48:23,336 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 02:48:23,336 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:48:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 02:48:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 02:48:23,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:23,339 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:48:23,339 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 02:48:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash -909960591, now seen corresponding path program 1 times [2018-01-21 02:48:23,339 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:23,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:23,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,341 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:23,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:48:23,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:23,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 02:48:23,375 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:23,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:48:23,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:48:23,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:23,376 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-01-21 02:48:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:23,395 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-01-21 02:48:23,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:48:23,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-21 02:48:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:23,397 INFO L225 Difference]: With dead ends: 58 [2018-01-21 02:48:23,397 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 02:48:23,397 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 02:48:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 02:48:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 02:48:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 02:48:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-01-21 02:48:23,402 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2018-01-21 02:48:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:23,402 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-01-21 02:48:23,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:48:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-01-21 02:48:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 02:48:23,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:23,403 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-21 02:48:23,403 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 02:48:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1600085006, now seen corresponding path program 1 times [2018-01-21 02:48:23,403 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:23,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:23,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:23,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:48:23,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:23,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 02:48:23,455 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:23,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:48:23,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:48:23,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:23,456 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-01-21 02:48:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:23,482 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-01-21 02:48:23,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 02:48:23,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-21 02:48:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:23,483 INFO L225 Difference]: With dead ends: 52 [2018-01-21 02:48:23,483 INFO L226 Difference]: Without dead ends: 36 [2018-01-21 02:48:23,484 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-21 02:48:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-01-21 02:48:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-21 02:48:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-01-21 02:48:23,487 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-01-21 02:48:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:23,488 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-01-21 02:48:23,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:48:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-01-21 02:48:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 02:48:23,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:23,488 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] [2018-01-21 02:48:23,488 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 02:48:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash 266045328, now seen corresponding path program 1 times [2018-01-21 02:48:23,489 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:23,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:23,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,490 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:23,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:23,533 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-21 02:48:23,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:23,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 02:48:23,533 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:23,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:48:23,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:48:23,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:23,534 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-01-21 02:48:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:23,583 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-21 02:48:23,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 02:48:23,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 02:48:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:23,585 INFO L225 Difference]: With dead ends: 48 [2018-01-21 02:48:23,585 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 02:48:23,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 02:48:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-01-21 02:48:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-21 02:48:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-21 02:48:23,591 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2018-01-21 02:48:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:23,591 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-21 02:48:23,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:48:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-21 02:48:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 02:48:23,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:23,593 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:48:23,593 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 02:48:23,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1941225697, now seen corresponding path program 1 times [2018-01-21 02:48:23,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:23,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:23,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:23,595 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:23,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 02:48:23,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:23,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 02:48:23,694 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:23,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:48:23,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:48:23,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:23,695 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-01-21 02:48:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:23,739 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-01-21 02:48:23,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:48:23,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-21 02:48:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:23,740 INFO L225 Difference]: With dead ends: 35 [2018-01-21 02:48:23,740 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 02:48:23,741 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 02:48:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 02:48:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 02:48:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 02:48:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 02:48:23,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-21 02:48:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:23,742 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 02:48:23,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:48:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 02:48:23,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 02:48:23,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 02:48:23 BoogieIcfgContainer [2018-01-21 02:48:23,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 02:48:23,748 INFO L168 Benchmark]: Toolchain (without parser) took 2061.12 ms. Allocated memory was 304.1 MB in the beginning and 465.6 MB in the end (delta: 161.5 MB). Free memory was 262.2 MB in the beginning and 360.3 MB in the end (delta: -98.1 MB). Peak memory consumption was 63.4 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:23,749 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 304.1 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 02:48:23,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.18 ms. Allocated memory is still 304.1 MB. Free memory was 261.2 MB in the beginning and 251.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:23,750 INFO L168 Benchmark]: Boogie Preprocessor took 32.84 ms. Allocated memory is still 304.1 MB. Free memory was 251.3 MB in the beginning and 250.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:23,750 INFO L168 Benchmark]: RCFGBuilder took 301.82 ms. Allocated memory is still 304.1 MB. Free memory was 250.2 MB in the beginning and 234.3 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:23,751 INFO L168 Benchmark]: TraceAbstraction took 1512.37 ms. Allocated memory was 304.1 MB in the beginning and 465.6 MB in the end (delta: 161.5 MB). Free memory was 234.3 MB in the beginning and 360.3 MB in the end (delta: -126.1 MB). Peak memory consumption was 35.4 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:23,752 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.23 ms. Allocated memory is still 304.1 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.18 ms. Allocated memory is still 304.1 MB. Free memory was 261.2 MB in the beginning and 251.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.84 ms. Allocated memory is still 304.1 MB. Free memory was 251.3 MB in the beginning and 250.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 301.82 ms. Allocated memory is still 304.1 MB. Free memory was 250.2 MB in the beginning and 234.3 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1512.37 ms. Allocated memory was 304.1 MB in the beginning and 465.6 MB in the end (delta: 161.5 MB). Free memory was 234.3 MB in the beginning and 360.3 MB in the end (delta: -126.1 MB). Peak memory consumption was 35.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 38 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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: [L541] int i, j; [L542] int val; [L543] int length = __VERIFIER_nondet_int(); [L544] COND TRUE length < 1 || length >= 2147483647 / sizeof(int) [L544] length = 1 VAL [length=1] [L545] EXPR, FCALL __builtin_alloca (length*sizeof(int)) VAL [__builtin_alloca (length*sizeof(int))={6:0}, length=1] [L545] int *arr = __builtin_alloca (length*sizeof(int)); VAL [__builtin_alloca (length*sizeof(int))={6:0}, arr={6:0}, length=1] [L546] COND FALSE !(!arr) [L547] i=0 VAL [__builtin_alloca (length*sizeof(int))={6:0}, arr={6:0}, i=0, length=1] [L547] COND TRUE i 0) [L554] j++ VAL [__builtin_alloca (length*sizeof(int))={6:0}, arr={6:0}, i=1, j=1, length=1, val=0] [L554] COND FALSE !(j