java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:46:35,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:46:35,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:46:35,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:46:35,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:46:35,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:46:35,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:46:35,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:46:35,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:46:35,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:46:35,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:46:35,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:46:35,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:46:35,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:46:35,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:46:35,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:46:35,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:46:35,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:46:35,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:46:35,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:46:35,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:46:35,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:46:35,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:46:35,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:46:35,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:46:35,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:46:35,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:46:35,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:46:35,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:46:35,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:46:35,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:46:35,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:46:35,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:46:35,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:46:35,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:46:35,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:46:35,154 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:46:35,185 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:46:35,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:46:35,186 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:46:35,186 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:46:35,190 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:46:35,191 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:46:35,191 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:46:35,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:46:35,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:46:35,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:46:35,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:46:35,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:46:35,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:46:35,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:46:35,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:46:35,194 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:46:35,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:46:35,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:46:35,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:46:35,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:46:35,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:46:35,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:46:35,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:46:35,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:46:35,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:46:35,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:46:35,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:46:35,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:46:35,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:46:35,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:46:35,198 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:46:35,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:46:35,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:46:35,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:46:35,282 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:46:35,282 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:46:35,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl [2018-10-04 12:46:35,284 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl' [2018-10-04 12:46:35,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:46:35,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:46:35,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:46:35,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:46:35,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:46:35,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:46:35,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:46:35,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:46:35,423 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:46:35,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... [2018-10-04 12:46:35,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:46:35,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:46:35,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:46:35,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:46:35,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/1) ... No working directory specified, using /storage/repos/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-10-04 12:46:35,543 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 12:46:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:46:35,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:46:36,129 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:46:36,130 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:46:36 BoogieIcfgContainer [2018-10-04 12:46:36,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:46:36,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:46:36,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:46:36,134 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:46:36,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:35" (1/2) ... [2018-10-04 12:46:36,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb6b082 and model type pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:46:36, skipping insertion in model container [2018-10-04 12:46:36,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:46:36" (2/2) ... [2018-10-04 12:46:36,138 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl [2018-10-04 12:46:36,148 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:46:36,156 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:46:36,206 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:46:36,207 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:46:36,207 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:46:36,208 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:46:36,208 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:46:36,208 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:46:36,208 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:46:36,208 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:46:36,208 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:46:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 12:46:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:36,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:36,238 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:36,239 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:36,246 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:36,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-04 12:46:36,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:36,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:36,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:36,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:36,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:46:36,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:46:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:46:36,547 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:36,550 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-04 12:46:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:36,619 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2018-10-04 12:46:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:46:36,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:46:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:36,635 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:46:36,635 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:46:36,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:46:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:46:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:46:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:46:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-10-04 12:46:36,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2018-10-04 12:46:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:36,682 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-10-04 12:46:36,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:46:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-10-04 12:46:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:36,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:36,684 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:36,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:36,684 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:36,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-10-04 12:46:36,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:36,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:36,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:36,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:36,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:36,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:36,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:46:36,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:46:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:46:36,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:36,797 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 3 states. [2018-10-04 12:46:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:36,826 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2018-10-04 12:46:36,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:46:36,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:46:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:36,828 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:46:36,828 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:46:36,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:46:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:46:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-04 12:46:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:46:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-10-04 12:46:36,838 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 14 [2018-10-04 12:46:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:36,838 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-10-04 12:46:36,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:46:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-10-04 12:46:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:36,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:36,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:36,840 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:36,840 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1820747817, now seen corresponding path program 1 times [2018-10-04 12:46:36,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:36,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:36,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:36,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:36,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:36,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:36,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:46:36,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:46:36,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:46:36,915 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:36,916 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 3 states. [2018-10-04 12:46:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:36,965 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2018-10-04 12:46:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:46:36,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:46:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:36,967 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:46:36,967 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:46:36,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:46:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:46:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:46:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:46:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-10-04 12:46:36,977 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 14 [2018-10-04 12:46:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:36,978 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-10-04 12:46:36,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:46:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-10-04 12:46:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:36,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:36,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:36,979 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:36,979 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1664872853, now seen corresponding path program 1 times [2018-10-04 12:46:36,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:36,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:36,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:36,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:37,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:37,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:46:37,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:46:37,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:46:37,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:37,095 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-10-04 12:46:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:37,167 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2018-10-04 12:46:37,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:46:37,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:46:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:37,171 INFO L225 Difference]: With dead ends: 85 [2018-10-04 12:46:37,172 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:46:37,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:46:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:46:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-10-04 12:46:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:46:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2018-10-04 12:46:37,203 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 14 [2018-10-04 12:46:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:37,204 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2018-10-04 12:46:37,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:46:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2018-10-04 12:46:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:37,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:37,207 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:37,208 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:37,208 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:37,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1607614551, now seen corresponding path program 1 times [2018-10-04 12:46:37,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:37,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:37,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:37,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:37,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:37,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:37,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:46:37,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:46:37,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:46:37,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:37,335 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand 4 states. [2018-10-04 12:46:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:37,455 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2018-10-04 12:46:37,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:46:37,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:46:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:37,460 INFO L225 Difference]: With dead ends: 113 [2018-10-04 12:46:37,460 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 12:46:37,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:46:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 12:46:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2018-10-04 12:46:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 12:46:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2018-10-04 12:46:37,483 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 14 [2018-10-04 12:46:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:37,483 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2018-10-04 12:46:37,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:46:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2018-10-04 12:46:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:37,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:37,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:37,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:37,485 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1607674133, now seen corresponding path program 1 times [2018-10-04 12:46:37,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:37,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:37,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:37,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:37,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:37,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:46:37,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:46:37,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:46:37,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:37,657 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand 4 states. [2018-10-04 12:46:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:37,806 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2018-10-04 12:46:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:46:37,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:46:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:37,810 INFO L225 Difference]: With dead ends: 150 [2018-10-04 12:46:37,810 INFO L226 Difference]: Without dead ends: 92 [2018-10-04 12:46:37,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:46:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-04 12:46:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2018-10-04 12:46:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 12:46:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-10-04 12:46:37,852 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 14 [2018-10-04 12:46:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:37,855 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-10-04 12:46:37,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:46:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-10-04 12:46:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:46:37,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:37,856 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:37,857 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:37,858 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:37,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1173123511, now seen corresponding path program 1 times [2018-10-04 12:46:37,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:37,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:37,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:38,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:46:38,034 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-04 12:46:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:38,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:46:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:46:38,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:46:38,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-04 12:46:38,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:46:38,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:46:38,288 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:38,288 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 6 states. [2018-10-04 12:46:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:38,865 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2018-10-04 12:46:38,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:46:38,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-10-04 12:46:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:38,866 INFO L225 Difference]: With dead ends: 119 [2018-10-04 12:46:38,867 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:46:38,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 8 [2018-10-04 12:46:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:46:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:46:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:46:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:46:38,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-10-04 12:46:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:38,869 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:46:38,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:46:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:46:38,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:46:38,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:46:38,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:38,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:38,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:38,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:39,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:46:40,109 WARN L178 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2018-10-04 12:46:40,488 WARN L178 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-04 12:46:40,762 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-10-04 12:46:40,925 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-10-04 12:46:41,114 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-10-04 12:46:41,347 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2018-10-04 12:46:41,510 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-10-04 12:46:41,627 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-10-04 12:46:41,774 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-10-04 12:46:42,061 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-04 12:46:42,065 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 313) no Hoare annotation was computed. [2018-10-04 12:46:42,065 INFO L421 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~r1 256)) (.cse1 (= ~mode2 0)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (= (+ ~p2_old 1) 0)) .cse0 .cse3 .cse2) (and (<= 512 ~mode3) .cse1 (<= (+ ~r1 256) 0) .cse3))) [2018-10-04 12:46:42,066 INFO L421 ceAbstractionStarter]: At program point L281(lines 276 282) the Hoare annotation is: (let ((.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (= (+ ~p2_old 1) 0))) (let ((.cse1 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse3 (<= ~r1 256)) (.cse0 (not .cse6)) (.cse2 (or .cse5 .cse6)) (.cse4 (<= 1 ULTIMATE.start_check_~tmp~77))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 (= ~mode2 0) .cse3 .cse4 .cse5) (and .cse0 (<= (+ ~r1 256) 0) .cse2 .cse4)))) [2018-10-04 12:46:42,066 INFO L421 ceAbstractionStarter]: At program point L310(lines 191 310) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~r1 256)) (.cse1 (= ~mode2 0)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (= (+ ~p2_old 1) 0)) .cse0 .cse3 .cse2) (and (<= 512 ~mode3) .cse1 (<= (+ ~r1 256) 0) (<= (+ ~mode1 256) 0) .cse3))) [2018-10-04 12:46:42,066 INFO L421 ceAbstractionStarter]: At program point L238(lines 231 239) the Hoare annotation is: (let ((.cse1 (<= 0 ~p2_new)) (.cse2 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse0 (= 0 (+ ~nomsg 1))) (.cse3 (<= ~r1 256))) (or (and (<= 512 ~mode3) (<= (+ ~r1 256) 0) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse1) (and (not (= (+ ~p2_old 1) 0)) .cse2 (= ~mode2 0) .cse0 .cse3))) [2018-10-04 12:46:42,067 INFO L421 ceAbstractionStarter]: At program point L302(lines 302 308) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse1 (<= ~r1 256)) (.cse2 (not (= 0 |ULTIMATE.start_assert_#in~arg|)))) (or (and .cse0 (= ~mode2 0) .cse1 .cse2 .cse3) (and (not (= (+ ~p2_old 1) 0)) .cse0 .cse3 .cse1 .cse2))) [2018-10-04 12:46:42,067 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-10-04 12:46:42,067 INFO L421 ceAbstractionStarter]: At program point L298(lines 294 299) the Hoare annotation is: (let ((.cse3 (= 0 (+ ~nomsg 1))) (.cse6 (= (+ ~p2_old 1) 0))) (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~r1 256)) (.cse4 (not .cse6)) (.cse5 (or .cse3 .cse6)) (.cse2 (not (= 0 |ULTIMATE.start_assert_#in~arg|)))) (or (and .cse0 (= ~mode2 0) .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse1 .cse2) (and .cse4 (<= (+ ~r1 256) 0) .cse5 (<= 1 ULTIMATE.start_check_~tmp~77) .cse2 (<= 1 ULTIMATE.start_main_~c1~84))))) [2018-10-04 12:46:42,067 INFO L421 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (let ((.cse3 (= 0 (+ ~nomsg 1))) (.cse7 (= (+ ~p2_old 1) 0))) (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~r1 256)) (.cse5 (not .cse7)) (.cse6 (or .cse3 .cse7)) (.cse2 (<= 1 ULTIMATE.start_check_~tmp~77)) (.cse4 (<= 1 ULTIMATE.start_main_~c1~84))) (or (and .cse0 (= ~mode2 0) .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse2 .cse4) (and .cse5 (<= (+ ~r1 256) 0) .cse6 .cse2 .cse4)))) [2018-10-04 12:46:42,068 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 313) no Hoare annotation was computed. [2018-10-04 12:46:42,068 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 313) no Hoare annotation was computed. [2018-10-04 12:46:42,068 INFO L421 ceAbstractionStarter]: At program point L214(lines 208 215) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~r1 256)) (.cse1 (= ~mode2 0)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (= (+ ~p2_old 1) 0)) .cse0 .cse3 .cse2) (and (<= 512 ~mode3) .cse1 (<= (+ ~r1 256) 0) .cse3))) [2018-10-04 12:46:42,068 INFO L421 ceAbstractionStarter]: At program point L243(lines 243 253) the Hoare annotation is: (let ((.cse1 (<= 0 ~p2_new)) (.cse2 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse0 (= 0 (+ ~nomsg 1))) (.cse3 (<= ~r1 256))) (or (and (<= 512 ~mode3) (<= (+ ~r1 256) 0) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse1) (and (not (= (+ ~p2_old 1) 0)) .cse2 (= ~mode2 0) .cse0 .cse3))) [2018-10-04 12:46:42,068 INFO L421 ceAbstractionStarter]: At program point L307(lines 307 311) the Hoare annotation is: false [2018-10-04 12:46:42,069 INFO L421 ceAbstractionStarter]: At program point L270(lines 270 277) the Hoare annotation is: (let ((.cse2 (= 0 (+ ~nomsg 1))) (.cse5 (= (+ ~p2_old 1) 0))) (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~r1 256)) (.cse3 (not .cse5)) (.cse4 (or .cse2 .cse5))) (or (and .cse0 (= ~mode2 0) .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse1) (and .cse3 (<= (+ ~r1 256) 0) .cse4)))) [2018-10-04 12:46:42,069 INFO L421 ceAbstractionStarter]: At program point L196(lines 196 209) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~r1 256)) (.cse1 (= ~mode2 0)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (= (+ ~p2_old 1) 0)) .cse0 .cse3 .cse2) (and (<= 512 ~mode3) .cse1 (<= (+ ~r1 256) 0) (<= (+ ~mode1 256) 0) .cse3))) [2018-10-04 12:46:42,069 INFO L421 ceAbstractionStarter]: At program point L258(lines 252 259) the Hoare annotation is: (let ((.cse1 (<= 0 ~p2_new)) (.cse2 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse0 (= 0 (+ ~nomsg 1))) (.cse3 (<= ~r1 256))) (or (and (<= (+ ~r1 256) 0) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse1) (and (not (= (+ ~p2_old 1) 0)) .cse2 (= ~mode2 0) .cse0 .cse3))) [2018-10-04 12:46:42,090 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:46:42 BoogieIcfgContainer [2018-10-04 12:46:42,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:46:42,091 INFO L168 Benchmark]: Toolchain (without parser) took 6714.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 364.8 MB). Peak memory consumption was 364.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:46:42,093 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:42,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:42,094 INFO L168 Benchmark]: Boogie Preprocessor took 31.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:42,095 INFO L168 Benchmark]: RCFGBuilder took 675.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:46:42,096 INFO L168 Benchmark]: TraceAbstraction took 5959.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 322.5 MB). Peak memory consumption was 322.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:46:42,101 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 675.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5959.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 322.5 MB). Peak memory consumption was 322.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 312]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || (((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~r1 <= 256)) || (((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || (((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~r1 <= 256)) || ((((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && ~mode1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((512 <= ~mode3 && ~r1 + 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~p2_new) || (((!(0 == assert_~arg) && ~r1 <= 256) && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || ((((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && ~mode2 == 0) && 0 == ~nomsg + 1) && ~r1 <= 256) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) || ((((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && (0 == ~nomsg + 1 || ~p2_old + 1 == 0)) && ~r1 <= 256) && !(0 == assert_#in~arg))) || (((((!(~p2_old + 1 == 0) && ~r1 + 256 <= 0) && (0 == ~nomsg + 1 || ~p2_old + 1 == 0)) && 1 <= check_~tmp~77) && !(0 == assert_#in~arg)) && 1 <= main_~c1~84) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 1 <= check_~tmp~77) && 0 == ~nomsg + 1) && 1 <= main_~c1~84) || (((((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && (0 == ~nomsg + 1 || ~p2_old + 1 == 0)) && ~r1 <= 256) && 1 <= check_~tmp~77) && 1 <= main_~c1~84)) || ((((!(~p2_old + 1 == 0) && ~r1 + 256 <= 0) && (0 == ~nomsg + 1 || ~p2_old + 1 == 0)) && 1 <= check_~tmp~77) && 1 <= main_~c1~84) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || (((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~r1 <= 256)) || (((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: (((~r1 + 256 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p2_new) || (((!(0 == assert_~arg) && ~r1 <= 256) && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || ((((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && ~mode2 == 0) && 0 == ~nomsg + 1) && ~r1 <= 256) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((512 <= ~mode3 && ~r1 + 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~p2_new) || (((!(0 == assert_~arg) && ~r1 <= 256) && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || ((((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && ~mode2 == 0) && 0 == ~nomsg + 1) && ~r1 <= 256) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || (((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && (0 == ~nomsg + 1 || ~p2_old + 1 == 0)) && ~r1 <= 256)) || ((!(~p2_old + 1 == 0) && ~r1 + 256 <= 0) && (0 == ~nomsg + 1 || ~p2_old + 1 == 0)) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) || ((((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~r1 <= 256) && !(0 == assert_#in~arg)) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (((((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && (0 == ~nomsg + 1 || ~p2_old + 1 == 0)) && ~r1 <= 256) && 1 <= check_~tmp~77) || ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 1 <= check_~tmp~77) && 0 == ~nomsg + 1)) || (((!(~p2_old + 1 == 0) && ~r1 + 256 <= 0) && (0 == ~nomsg + 1 || ~p2_old + 1 == 0)) && 1 <= check_~tmp~77) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || (((!(~p2_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~r1 <= 256)) || ((((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && ~mode1 + 256 <= 0) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 5.8s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 134 SDslu, 151 SDs, 0 SdLazy, 71 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 77 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 73 NumberOfFragments, 737 HoareAnnotationTreeSize, 13 FomulaSimplifications, 2171 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 478 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 12174 SizeOfPredicates, 1 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 22/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-46-42-121.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-46-42-121.csv Received shutdown request...