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/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 21:55:05,986 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 21:55:05,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 21:55:06,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 21:55:06,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 21:55:06,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 21:55:06,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 21:55:06,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 21:55:06,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 21:55:06,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 21:55:06,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 21:55:06,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 21:55:06,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 21:55:06,016 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 21:55:06,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 21:55:06,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 21:55:06,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 21:55:06,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 21:55:06,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 21:55:06,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 21:55:06,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 21:55:06,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 21:55:06,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 21:55:06,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 21:55:06,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 21:55:06,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 21:55:06,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 21:55:06,035 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 21:55:06,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 21:55:06,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 21:55:06,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 21:55:06,036 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 21:55:06,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 21:55:06,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 21:55:06,047 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 21:55:06,047 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 21:55:06,047 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 21:55:06,047 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 21:55:06,047 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 21:55:06,048 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 21:55:06,048 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 21:55:06,048 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 21:55:06,048 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 21:55:06,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 21:55:06,049 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 21:55:06,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 21:55:06,049 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 21:55:06,049 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 21:55:06,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 21:55:06,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 21:55:06,050 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 21:55:06,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 21:55:06,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 21:55:06,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 21:55:06,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 21:55:06,050 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 21:55:06,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 21:55:06,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:55:06,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 21:55:06,051 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 21:55:06,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 21:55:06,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 21:55:06,052 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 21:55:06,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 21:55:06,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 21:55:06,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 21:55:06,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 21:55:06,053 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 21:55:06,053 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 21:55:06,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 21:55:06,100 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 21:55:06,104 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 21:55:06,105 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 21:55:06,106 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 21:55:06,106 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-20 21:55:06,265 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 21:55:06,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 21:55:06,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 21:55:06,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 21:55:06,280 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 21:55:06,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,285 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 20.01 09:55:06, skipping insertion in model container [2018-01-20 21:55:06,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,306 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:55:06,347 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:55:06,491 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:55:06,513 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:55:06,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06 WrapperNode [2018-01-20 21:55:06,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 21:55:06,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 21:55:06,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 21:55:06,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 21:55:06,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (1/1) ... [2018-01-20 21:55:06,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 21:55:06,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 21:55:06,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 21:55:06,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 21:55:06,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:55:06,600 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 21:55:06,600 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 21:55:06,600 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 21:55:06,600 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 21:55:06,600 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 21:55:06,600 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 21:55:06,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 21:55:06,601 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 21:55:06,601 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 21:55:06,601 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 21:55:06,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 21:55:06,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 21:55:06,798 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 21:55:06,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:55:06 BoogieIcfgContainer [2018-01-20 21:55:06,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 21:55:06,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 21:55:06,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 21:55:06,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 21:55:06,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 09:55:06" (1/3) ... [2018-01-20 21:55:06,804 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 20.01 09:55:06, skipping insertion in model container [2018-01-20 21:55:06,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:06" (2/3) ... [2018-01-20 21:55:06,805 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 20.01 09:55:06, skipping insertion in model container [2018-01-20 21:55:06,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:55:06" (3/3) ... [2018-01-20 21:55:06,808 INFO L105 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-20 21:55:06,819 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 21:55:06,827 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 21:55:06,882 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:06,883 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:06,883 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:06,885 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:06,885 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:06,885 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:06,885 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:06,885 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 21:55:06,886 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 21:55:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 21:55:06,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:06,933 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 21:55:06,933 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 21:55:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash 106673, now seen corresponding path program 1 times [2018-01-20 21:55:06,959 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:06,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:07,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:07,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:07,136 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:55:07,144 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:07,153 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:07,154 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:07,154 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:07,154 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:07,154 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:07,154 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:07,155 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:07,155 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 21:55:07,155 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 21:55:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 21:55:07,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:07,159 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:07,159 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1701202051, now seen corresponding path program 1 times [2018-01-20 21:55:07,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:07,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:07,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:07,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:07,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:55:07,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:07,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:55:07,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:55:07,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:55:07,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:55:07,330 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-01-20 21:55:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:07,470 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-01-20 21:55:07,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:55:07,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-20 21:55:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:07,481 INFO L225 Difference]: With dead ends: 58 [2018-01-20 21:55:07,481 INFO L226 Difference]: Without dead ends: 33 [2018-01-20 21:55:07,484 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-20 21:55:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-20 21:55:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-20 21:55:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-20 21:55:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-01-20 21:55:07,514 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-01-20 21:55:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:07,514 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-01-20 21:55:07,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:55:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-01-20 21:55:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 21:55:07,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:07,516 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-20 21:55:07,516 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash 83400416, now seen corresponding path program 1 times [2018-01-20 21:55:07,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:07,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:07,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:07,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:07,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:55:07,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:07,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:55:07,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:55:07,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:55:07,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:55:07,602 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-01-20 21:55:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:07,644 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-01-20 21:55:07,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:55:07,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-20 21:55:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:07,645 INFO L225 Difference]: With dead ends: 56 [2018-01-20 21:55:07,646 INFO L226 Difference]: Without dead ends: 38 [2018-01-20 21:55:07,646 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-20 21:55:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-20 21:55:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-01-20 21:55:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-20 21:55:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-20 21:55:07,653 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-01-20 21:55:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:07,653 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-20 21:55:07,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:55:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-20 21:55:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 21:55:07,654 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:07,655 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-20 21:55:07,655 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:07,655 INFO L82 PathProgramCache]: Analyzing trace with hash -2028475934, now seen corresponding path program 1 times [2018-01-20 21:55:07,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:07,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:07,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:07,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:07,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:07,743 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-20 21:55:07,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:07,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:55:07,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:55:07,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:55:07,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:55:07,744 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-01-20 21:55:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:07,787 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-20 21:55:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:55:07,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-20 21:55:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:07,789 INFO L225 Difference]: With dead ends: 52 [2018-01-20 21:55:07,789 INFO L226 Difference]: Without dead ends: 45 [2018-01-20 21:55:07,789 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-20 21:55:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-20 21:55:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-01-20 21:55:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-20 21:55:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-20 21:55:07,794 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2018-01-20 21:55:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:07,794 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-20 21:55:07,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:55:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-20 21:55:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:55:07,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:07,795 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-20 21:55:07,795 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1502089971, now seen corresponding path program 1 times [2018-01-20 21:55:07,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:07,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:07,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:07,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:07,848 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:55:07,855 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:07,860 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:07,860 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:07,873 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:07,873 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:07,873 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:07,873 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:07,873 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:07,873 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:07,873 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:07,874 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 21:55:07,874 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 21:55:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 21:55:07,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:07,876 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:07,876 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:07,876 INFO L82 PathProgramCache]: Analyzing trace with hash -909960591, now seen corresponding path program 1 times [2018-01-20 21:55:07,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:07,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:07,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:07,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:07,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:55:07,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:07,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:55:07,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:55:07,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:55:07,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:55:07,910 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-01-20 21:55:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:07,930 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-01-20 21:55:07,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:55:07,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-20 21:55:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:07,931 INFO L225 Difference]: With dead ends: 58 [2018-01-20 21:55:07,931 INFO L226 Difference]: Without dead ends: 31 [2018-01-20 21:55:07,932 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-20 21:55:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-20 21:55:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-20 21:55:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-20 21:55:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-01-20 21:55:07,937 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2018-01-20 21:55:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:07,937 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-01-20 21:55:07,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:55:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-01-20 21:55:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 21:55:07,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:07,938 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-20 21:55:07,938 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1600085006, now seen corresponding path program 1 times [2018-01-20 21:55:07,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:07,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:07,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:07,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:07,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:55:07,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:07,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:55:07,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:55:07,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:55:07,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:55:07,984 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-01-20 21:55:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:08,012 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-01-20 21:55:08,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:55:08,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-20 21:55:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:08,013 INFO L225 Difference]: With dead ends: 52 [2018-01-20 21:55:08,013 INFO L226 Difference]: Without dead ends: 36 [2018-01-20 21:55:08,014 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-20 21:55:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-20 21:55:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-01-20 21:55:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-20 21:55:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-01-20 21:55:08,017 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-01-20 21:55:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:08,018 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-01-20 21:55:08,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:55:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-01-20 21:55:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 21:55:08,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:08,018 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-20 21:55:08,018 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash 266045328, now seen corresponding path program 1 times [2018-01-20 21:55:08,019 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:08,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:08,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:08,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:08,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:08,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:08,064 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-20 21:55:08,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:08,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:55:08,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:55:08,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:55:08,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:55:08,065 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-01-20 21:55:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:08,093 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-20 21:55:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:55:08,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-20 21:55:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:08,094 INFO L225 Difference]: With dead ends: 48 [2018-01-20 21:55:08,094 INFO L226 Difference]: Without dead ends: 43 [2018-01-20 21:55:08,095 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-20 21:55:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-20 21:55:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-01-20 21:55:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-20 21:55:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-20 21:55:08,100 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2018-01-20 21:55:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:08,101 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-20 21:55:08,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:55:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-20 21:55:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 21:55:08,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:08,102 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-20 21:55:08,102 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1941225697, now seen corresponding path program 1 times [2018-01-20 21:55:08,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:08,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:08,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:08,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:08,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:08,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:08,193 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-20 21:55:08,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:08,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:55:08,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:55:08,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:55:08,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:55:08,195 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-01-20 21:55:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:08,250 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-01-20 21:55:08,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:55:08,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-20 21:55:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:08,251 INFO L225 Difference]: With dead ends: 35 [2018-01-20 21:55:08,251 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:55:08,252 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-20 21:55:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:55:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:55:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:55:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:55:08,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-20 21:55:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:08,253 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:55:08,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:55:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:55:08,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:55:08,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 09:55:08 BoogieIcfgContainer [2018-01-20 21:55:08,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 21:55:08,259 INFO L168 Benchmark]: Toolchain (without parser) took 1992.49 ms. Allocated memory was 285.7 MB in the beginning and 424.1 MB in the end (delta: 138.4 MB). Free memory was 245.6 MB in the beginning and 318.7 MB in the end (delta: -73.1 MB). Peak memory consumption was 65.3 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:08,260 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 285.7 MB. Free memory is still 251.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 21:55:08,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.71 ms. Allocated memory is still 285.7 MB. Free memory was 244.7 MB in the beginning and 234.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:08,260 INFO L168 Benchmark]: Boogie Preprocessor took 28.28 ms. Allocated memory is still 285.7 MB. Free memory was 234.7 MB in the beginning and 233.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-20 21:55:08,261 INFO L168 Benchmark]: RCFGBuilder took 248.46 ms. Allocated memory is still 285.7 MB. Free memory was 232.7 MB in the beginning and 217.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:08,261 INFO L168 Benchmark]: TraceAbstraction took 1458.09 ms. Allocated memory was 285.7 MB in the beginning and 424.1 MB in the end (delta: 138.4 MB). Free memory was 217.7 MB in the beginning and 318.7 MB in the end (delta: -101.0 MB). Peak memory consumption was 37.4 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:08,263 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.16 ms. Allocated memory is still 285.7 MB. Free memory is still 251.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 248.71 ms. Allocated memory is still 285.7 MB. Free memory was 244.7 MB in the beginning and 234.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.28 ms. Allocated memory is still 285.7 MB. Free memory was 234.7 MB in the beginning and 233.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 248.46 ms. Allocated memory is still 285.7 MB. Free memory was 232.7 MB in the beginning and 217.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1458.09 ms. Allocated memory was 285.7 MB in the beginning and 424.1 MB in the end (delta: 138.4 MB). Free memory was 217.7 MB in the beginning and 318.7 MB in the end (delta: -101.0 MB). Peak memory consumption was 37.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.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=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