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/reverse_array_alloca_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 21:54:41,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 21:54:41,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 21:54:41,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 21:54:41,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 21:54:41,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 21:54:41,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 21:54:41,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 21:54:41,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 21:54:41,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 21:54:41,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 21:54:41,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 21:54:41,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 21:54:41,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 21:54:41,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 21:54:41,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 21:54:41,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 21:54:41,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 21:54:41,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 21:54:41,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 21:54:41,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 21:54:41,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 21:54:41,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 21:54:41,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 21:54:41,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 21:54:41,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 21:54:41,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 21:54:41,341 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 21:54:41,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 21:54:41,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 21:54:41,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 21:54:41,343 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:54:41,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 21:54:41,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 21:54:41,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 21:54:41,355 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 21:54:41,355 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 21:54:41,355 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 21:54:41,355 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 21:54:41,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 21:54:41,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 21:54:41,356 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 21:54:41,356 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 21:54:41,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 21:54:41,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 21:54:41,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 21:54:41,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 21:54:41,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 21:54:41,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 21:54:41,358 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 21:54:41,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 21:54:41,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 21:54:41,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 21:54:41,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 21:54:41,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 21:54:41,359 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 21:54:41,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 21:54:41,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:54:41,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 21:54:41,360 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 21:54:41,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 21:54:41,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 21:54:41,360 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 21:54:41,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 21:54:41,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 21:54:41,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 21:54:41,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 21:54:41,362 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 21:54:41,362 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 21:54:41,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 21:54:41,411 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 21:54:41,415 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 21:54:41,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 21:54:41,417 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 21:54:41,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-20 21:54:41,616 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 21:54:41,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 21:54:41,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 21:54:41,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 21:54:41,628 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 21:54:41,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,631 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:54:41, skipping insertion in model container [2018-01-20 21:54:41,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,648 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:54:41,690 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:54:41,813 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:54:41,828 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:54:41,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41 WrapperNode [2018-01-20 21:54:41,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 21:54:41,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 21:54:41,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 21:54:41,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 21:54:41,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (1/1) ... [2018-01-20 21:54:41,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 21:54:41,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 21:54:41,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 21:54:41,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 21:54:41,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (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:54:41,927 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 21:54:41,927 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 21:54:41,927 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 21:54:41,927 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 21:54:41,927 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 21:54:41,928 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 21:54:41,928 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 21:54:41,928 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 21:54:41,928 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 21:54:41,928 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 21:54:41,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 21:54:41,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 21:54:42,149 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 21:54:42,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:54:42 BoogieIcfgContainer [2018-01-20 21:54:42,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 21:54:42,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 21:54:42,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 21:54:42,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 21:54:42,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 09:54:41" (1/3) ... [2018-01-20 21:54:42,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ff28e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:54:42, skipping insertion in model container [2018-01-20 21:54:42,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:54:41" (2/3) ... [2018-01-20 21:54:42,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ff28e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:54:42, skipping insertion in model container [2018-01-20 21:54:42,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:54:42" (3/3) ... [2018-01-20 21:54:42,157 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-20 21:54:42,166 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 21:54:42,173 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 21:54:42,222 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:42,222 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:42,223 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:42,223 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:42,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:42,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:42,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:42,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 21:54:42,224 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:54:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 21:54:42,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:42,253 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 21:54:42,254 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 21:54:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-20 21:54:42,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:42,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:42,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:42,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:42,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:42,377 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:54:42,383 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:42,390 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:42,390 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:42,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:42,391 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:42,391 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:42,391 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:42,391 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:42,391 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 21:54:42,392 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:54:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 21:54:42,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:42,396 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] [2018-01-20 21:54:42,396 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:42,396 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-20 21:54:42,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:42,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:42,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:42,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:42,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:42,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:42,480 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:54:42,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:42,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:54:42,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:54:42,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:54:42,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:42,502 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 21:54:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:42,600 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-20 21:54:42,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:54:42,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 21:54:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:42,610 INFO L225 Difference]: With dead ends: 70 [2018-01-20 21:54:42,611 INFO L226 Difference]: Without dead ends: 42 [2018-01-20 21:54:42,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-20 21:54:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-20 21:54:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-20 21:54:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-20 21:54:42,647 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-20 21:54:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:42,647 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-20 21:54:42,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:54:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-20 21:54:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 21:54:42,648 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:42,649 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:42,649 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:42,649 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-20 21:54:42,649 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:42,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:42,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:42,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:42,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:42,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:42,831 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:54:42,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:42,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:54:42,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:54:42,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:54:42,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:54:42,834 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-20 21:54:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:42,875 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-20 21:54:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:54:42,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-20 21:54:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:42,880 INFO L225 Difference]: With dead ends: 109 [2018-01-20 21:54:42,880 INFO L226 Difference]: Without dead ends: 75 [2018-01-20 21:54:42,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:54:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-20 21:54:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-20 21:54:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 21:54:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 21:54:42,889 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-20 21:54:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:42,890 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 21:54:42,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:54:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 21:54:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 21:54:42,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:42,891 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:42,892 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-20 21:54:42,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:42,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:42,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:42,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:42,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:42,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:42,962 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:54:42,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:42,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:54:42,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:54:42,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:54:42,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:54:42,964 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-20 21:54:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:43,029 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-20 21:54:43,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:54:43,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-20 21:54:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:43,031 INFO L225 Difference]: With dead ends: 75 [2018-01-20 21:54:43,031 INFO L226 Difference]: Without dead ends: 52 [2018-01-20 21:54:43,032 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:54:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-20 21:54:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-20 21:54:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-20 21:54:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-20 21:54:43,038 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-20 21:54:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:43,039 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-20 21:54:43,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:54:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-20 21:54:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 21:54:43,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:43,041 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:43,041 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:43,041 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-20 21:54:43,041 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:43,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:43,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:43,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:43,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:43,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:43,521 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 64 DAG size of output 32 [2018-01-20 21:54:43,663 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-20 21:54:43,856 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-20 21:54:44,055 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 62 DAG size of output 36 [2018-01-20 21:54:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:44,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:44,227 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:44,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:44,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:44,362 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 21:54:44,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:44,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-20 21:54:44,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:44,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-20 21:54:44,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:44,414 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:44,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 21:54:44,419 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-20 21:54:44,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-20 21:54:44,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-20 21:54:44,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:44,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:44,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:44,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-20 21:54:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:44,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:44,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2018-01-20 21:54:44,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-20 21:54:44,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-20 21:54:44,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-01-20 21:54:44,557 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 17 states. [2018-01-20 21:54:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:45,168 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-20 21:54:45,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 21:54:45,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-01-20 21:54:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:45,170 INFO L225 Difference]: With dead ends: 102 [2018-01-20 21:54:45,170 INFO L226 Difference]: Without dead ends: 81 [2018-01-20 21:54:45,171 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-01-20 21:54:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-20 21:54:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-20 21:54:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 21:54:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-20 21:54:45,179 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-20 21:54:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:45,179 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-20 21:54:45,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-20 21:54:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-20 21:54:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:54:45,181 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:45,181 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:45,181 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:45,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-20 21:54:45,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:45,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:45,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:45,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:45,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:45,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:45,380 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:54:45,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:45,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-20 21:54:45,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 21:54:45,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 21:54:45,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-20 21:54:45,381 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-20 21:54:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:45,650 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-20 21:54:45,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 21:54:45,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-20 21:54:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:45,651 INFO L225 Difference]: With dead ends: 128 [2018-01-20 21:54:45,651 INFO L226 Difference]: Without dead ends: 121 [2018-01-20 21:54:45,652 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-01-20 21:54:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-20 21:54:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-20 21:54:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-20 21:54:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-20 21:54:45,661 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-20 21:54:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:45,661 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-20 21:54:45,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 21:54:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-20 21:54:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:54:45,663 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:45,663 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:45,663 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:45,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-20 21:54:45,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:45,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:45,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:45,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:45,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:45,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:54:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:45,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:45,736 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:45,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:45,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:45,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:45,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-20 21:54:45,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 21:54:45,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 21:54:45,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-01-20 21:54:45,833 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-20 21:54:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:45,907 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-20 21:54:45,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 21:54:45,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-20 21:54:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:45,909 INFO L225 Difference]: With dead ends: 185 [2018-01-20 21:54:45,910 INFO L226 Difference]: Without dead ends: 156 [2018-01-20 21:54:45,910 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-01-20 21:54:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-20 21:54:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-20 21:54:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-20 21:54:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-20 21:54:45,925 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-20 21:54:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:45,925 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-20 21:54:45,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 21:54:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-20 21:54:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 21:54:45,927 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:45,927 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:45,927 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-20 21:54:45,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:45,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:45,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:45,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:45,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:45,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:46,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:46,145 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:46,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:46,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:46,242 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 21:54:46,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:46,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-20 21:54:46,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:46,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-20 21:54:46,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:46,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:46,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:46,276 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-20 21:54:46,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-20 21:54:46,334 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 21:54:46,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-01-20 21:54:46,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:46,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:46,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:46,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-20 21:54:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:46,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:46,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-01-20 21:54:46,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-20 21:54:46,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-20 21:54:46,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-20 21:54:46,374 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-20 21:54:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:47,205 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-20 21:54:47,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 21:54:47,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-20 21:54:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:47,207 INFO L225 Difference]: With dead ends: 234 [2018-01-20 21:54:47,207 INFO L226 Difference]: Without dead ends: 227 [2018-01-20 21:54:47,208 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-01-20 21:54:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-20 21:54:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-20 21:54:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-20 21:54:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-20 21:54:47,220 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-20 21:54:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:47,220 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-20 21:54:47,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-20 21:54:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-20 21:54:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 21:54:47,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:47,222 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:47,223 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-20 21:54:47,223 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:47,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:47,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:47,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:47,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:47,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:48,219 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 82 DAG size of output 43 [2018-01-20 21:54:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:48,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:48,422 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:48,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:48,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:48,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:48,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-20 21:54:48,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-20 21:54:48,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-20 21:54:48,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-01-20 21:54:48,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:48,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:48,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-20 21:54:48,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-01-20 21:54:48,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:48,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:48,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-20 21:54:48,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 21:54:48,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-20 21:54:48,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-01-20 21:54:48,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:48,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 21:54:48,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-20 21:54:48,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 21:54:48,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-01-20 21:54:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:48,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:48,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2018-01-20 21:54:48,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-20 21:54:48,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-20 21:54:48,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-01-20 21:54:48,760 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 26 states. [2018-01-20 21:54:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:50,397 INFO L93 Difference]: Finished difference Result 250 states and 281 transitions. [2018-01-20 21:54:50,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-20 21:54:50,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2018-01-20 21:54:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:50,399 INFO L225 Difference]: With dead ends: 250 [2018-01-20 21:54:50,399 INFO L226 Difference]: Without dead ends: 220 [2018-01-20 21:54:50,401 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=559, Invalid=2863, Unknown=0, NotChecked=0, Total=3422 [2018-01-20 21:54:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-20 21:54:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 109. [2018-01-20 21:54:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-20 21:54:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-01-20 21:54:50,412 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 34 [2018-01-20 21:54:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:50,413 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-01-20 21:54:50,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-20 21:54:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-01-20 21:54:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 21:54:50,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:50,414 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:50,414 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:50,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-20 21:54:50,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:50,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:50,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:50,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:50,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:50,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:50,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:50,519 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:50,525 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:54:50,538 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:54:50,545 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:54:50,553 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:54:50,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:50,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:50,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-01-20 21:54:50,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 21:54:50,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 21:54:50,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-01-20 21:54:50,661 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 11 states. [2018-01-20 21:54:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:50,783 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2018-01-20 21:54:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 21:54:50,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-20 21:54:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:50,786 INFO L225 Difference]: With dead ends: 201 [2018-01-20 21:54:50,786 INFO L226 Difference]: Without dead ends: 172 [2018-01-20 21:54:50,787 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-01-20 21:54:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-20 21:54:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 121. [2018-01-20 21:54:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-20 21:54:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-01-20 21:54:50,800 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 37 [2018-01-20 21:54:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:50,800 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-01-20 21:54:50,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 21:54:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-01-20 21:54:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 21:54:50,801 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:50,802 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:50,802 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-20 21:54:50,802 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:50,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:50,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:50,803 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:54:50,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:50,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:51,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:54:51,063 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:54:51,069 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 21:54:51,079 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:54:51,088 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 21:54:51,093 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 21:54:51,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:54:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:54:51,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:54:51,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-20 21:54:51,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-20 21:54:51,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-20 21:54:51,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-01-20 21:54:51,235 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 13 states. [2018-01-20 21:54:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:51,332 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2018-01-20 21:54:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 21:54:51,333 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-20 21:54:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:51,333 INFO L225 Difference]: With dead ends: 232 [2018-01-20 21:54:51,334 INFO L226 Difference]: Without dead ends: 194 [2018-01-20 21:54:51,334 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-01-20 21:54:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-20 21:54:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 126. [2018-01-20 21:54:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-20 21:54:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-20 21:54:51,344 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 37 [2018-01-20 21:54:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:51,344 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-20 21:54:51,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-20 21:54:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-20 21:54:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 21:54:51,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:51,344 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:51,345 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:54:51,345 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-20 21:54:51,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:51,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:51,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,345 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 21:54:51,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:54:51,378 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:54:51,385 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:51,391 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:51,391 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:54:51,402 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:54:51,402 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:54:51,402 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:54:51,402 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:54:51,402 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:54:51,402 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:54:51,403 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:54:51,403 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 21:54:51,403 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:54:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:54:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 21:54:51,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:51,404 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:51,404 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:51,404 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-20 21:54:51,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:51,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:51,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:51,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:51,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:51,414 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:54:51,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:51,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:54:51,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:54:51,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:54:51,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:51,415 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 21:54:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:51,417 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-20 21:54:51,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:54:51,417 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 21:54:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:51,418 INFO L225 Difference]: With dead ends: 70 [2018-01-20 21:54:51,418 INFO L226 Difference]: Without dead ends: 40 [2018-01-20 21:54:51,418 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:54:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-20 21:54:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-20 21:54:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-20 21:54:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-20 21:54:51,421 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-20 21:54:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:51,421 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-20 21:54:51,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:54:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-20 21:54:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 21:54:51,422 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:51,422 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:51,422 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-20 21:54:51,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:51,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:51,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:51,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:51,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:51,477 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:54:51,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:51,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:54:51,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:54:51,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:54:51,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:54:51,479 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-20 21:54:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:51,499 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-20 21:54:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:54:51,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-20 21:54:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:51,500 INFO L225 Difference]: With dead ends: 105 [2018-01-20 21:54:51,500 INFO L226 Difference]: Without dead ends: 73 [2018-01-20 21:54:51,501 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:54:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-20 21:54:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-20 21:54:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 21:54:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 21:54:51,503 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-20 21:54:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:51,504 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 21:54:51,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:54:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 21:54:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 21:54:51,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:51,504 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:51,505 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-20 21:54:51,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:51,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:51,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:51,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:51,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:51,544 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:54:51,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:51,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:54:51,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:54:51,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:54:51,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:54:51,546 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-20 21:54:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:51,568 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-20 21:54:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:54:51,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-20 21:54:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:51,570 INFO L225 Difference]: With dead ends: 71 [2018-01-20 21:54:51,570 INFO L226 Difference]: Without dead ends: 50 [2018-01-20 21:54:51,570 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:54:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-20 21:54:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-20 21:54:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 21:54:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 21:54:51,572 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-20 21:54:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:51,572 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 21:54:51,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:54:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 21:54:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 21:54:51,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:54:51,572 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:54:51,573 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 21:54:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-20 21:54:51,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:54:51,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:54:51,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:54:51,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:54:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:54:51,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:54:51,630 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:54:51,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:54:51,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:54:51,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:54:51,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:54:51,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:54:51,632 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-20 21:54:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:54:51,648 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-20 21:54:51,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:54:51,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-20 21:54:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:54:51,648 INFO L225 Difference]: With dead ends: 43 [2018-01-20 21:54:51,649 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:54:51,649 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:54:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:54:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:54:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:54:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:54:51,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-20 21:54:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:54:51,650 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:54:51,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:54:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:54:51,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:54:51,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 09:54:51 BoogieIcfgContainer [2018-01-20 21:54:51,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 21:54:51,654 INFO L168 Benchmark]: Toolchain (without parser) took 10036.88 ms. Allocated memory was 308.3 MB in the beginning and 579.9 MB in the end (delta: 271.6 MB). Free memory was 268.2 MB in the beginning and 497.2 MB in the end (delta: -229.0 MB). Peak memory consumption was 42.6 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:51,655 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 21:54:51,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.97 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:51,655 INFO L168 Benchmark]: Boogie Preprocessor took 34.71 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:51,656 INFO L168 Benchmark]: RCFGBuilder took 279.35 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 238.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:51,656 INFO L168 Benchmark]: TraceAbstraction took 9502.08 ms. Allocated memory was 308.3 MB in the beginning and 579.9 MB in the end (delta: 271.6 MB). Free memory was 238.1 MB in the beginning and 497.2 MB in the end (delta: -259.1 MB). Peak memory consumption was 12.5 MB. Max. memory is 5.3 GB. [2018-01-20 21:54:51,657 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.97 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.71 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 279.35 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 238.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9502.08 ms. Allocated memory was 308.3 MB in the beginning and 579.9 MB in the end (delta: 271.6 MB). Free memory was 238.1 MB in the beginning and 497.2 MB in the end (delta: -259.1 MB). Peak memory consumption was 12.5 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, 45 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=45occurred 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, tmp; [L542] int length = __VERIFIER_nondet_int(); [L543] COND FALSE !(length < 1) VAL [length=2] [L544] COND TRUE length % 2 == 0 [L544] length++ VAL [length=3] [L545] EXPR, FCALL __builtin_alloca (length*sizeof(int)) VAL [__builtin_alloca (length*sizeof(int))={13:0}, length=3] [L545] int *arr = __builtin_alloca (length*sizeof(int)); [L546] i=0 VAL [__builtin_alloca (length*sizeof(int))={13:0}, arr={13:0}, i=0, length=3] [L546] COND TRUE i