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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:47:57,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:47:57,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:47:57,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:47:57,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:47:57,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:47:57,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:47:57,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:47:57,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:47:57,136 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:47:57,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:47:57,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:47:57,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:47:57,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:47:57,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:47:57,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:47:57,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:47:57,159 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:47:57,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:47:57,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:47:57,168 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:47:57,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:47:57,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:47:57,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:47:57,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:47:57,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:47:57,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:47:57,175 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:47:57,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:47:57,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:47:57,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:47:57,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:47:57,178 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:47:57,178 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:47:57,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:47:57,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:47:57,181 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:47:57,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:47:57,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:47:57,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:47:57,208 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:47:57,209 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:47:57,209 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:47:57,212 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:47:57,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:47:57,212 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:47:57,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:47:57,212 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:47:57,213 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:47:57,213 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:47:57,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:47:57,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:47:57,213 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:47:57,214 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:47:57,214 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:47:57,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:47:57,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:47:57,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:47:57,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:47:57,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:47:57,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:47:57,216 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:47:57,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:47:57,217 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:47:57,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:47:57,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:47:57,217 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:47:57,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:47:57,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:47:57,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:47:57,299 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:47:57,299 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:47:57,300 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl [2018-10-02 11:47:57,300 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl' [2018-10-02 11:47:57,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:47:57,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:47:57,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:47:57,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:47:57,395 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:47:57,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:47:57,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:47:57,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:47:57,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:47:57,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/1) ... [2018-10-02 11:47:57,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:47:57,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:47:57,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:47:57,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:47:57,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (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-02 11:47:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:47:57,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:47:58,159 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:47:58,160 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:47:58 BoogieIcfgContainer [2018-10-02 11:47:58,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:47:58,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:47:58,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:47:58,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:47:58,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:47:57" (1/2) ... [2018-10-02 11:47:58,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dafe807 and model type pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:47:58, skipping insertion in model container [2018-10-02 11:47:58,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:47:58" (2/2) ... [2018-10-02 11:47:58,168 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl [2018-10-02 11:47:58,177 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:47:58,185 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:47:58,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:47:58,228 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:47:58,228 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:47:58,228 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:47:58,228 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:47:58,228 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:47:58,229 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:47:58,229 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:47:58,229 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:47:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-02 11:47:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:47:58,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:47:58,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:47:58,255 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:47:58,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:47:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-02 11:47:58,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:47:58,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:47:58,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:58,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:47:58,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:47:58,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-02 11:47:58,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:47:58,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:47:58,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:47:58,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:47:58,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:47:58,545 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-02 11:47:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:47:58,600 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-10-02 11:47:58,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:47:58,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:47:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:47:58,614 INFO L225 Difference]: With dead ends: 45 [2018-10-02 11:47:58,614 INFO L226 Difference]: Without dead ends: 29 [2018-10-02 11:47:58,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-02 11:47:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-02 11:47:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-02 11:47:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 11:47:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-02 11:47:58,665 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-10-02 11:47:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:47:58,665 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-02 11:47:58,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:47:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-02 11:47:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:47:58,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:47:58,667 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:47:58,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:47:58,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:47:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-10-02 11:47:58,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:47:58,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:47:58,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:58,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:47:58,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:47:58,746 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-02 11:47:58,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:47:58,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:47:58,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:47:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:47:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:47:58,749 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-10-02 11:47:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:47:58,783 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-10-02 11:47:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:47:58,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:47:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:47:58,785 INFO L225 Difference]: With dead ends: 79 [2018-10-02 11:47:58,786 INFO L226 Difference]: Without dead ends: 53 [2018-10-02 11:47:58,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-02 11:47:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-02 11:47:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-02 11:47:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-02 11:47:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-10-02 11:47:58,802 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-10-02 11:47:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:47:58,803 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-10-02 11:47:58,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:47:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-10-02 11:47:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:47:58,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:47:58,804 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:47:58,805 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:47:58,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:47:58,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-10-02 11:47:58,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:47:58,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:47:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:58,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:47:58,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:47:59,082 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-02 11:47:59,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:47:59,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:47:59,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:47:59,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:47:59,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:47:59,084 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-10-02 11:47:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:47:59,259 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-10-02 11:47:59,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:47:59,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-02 11:47:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:47:59,268 INFO L225 Difference]: With dead ends: 109 [2018-10-02 11:47:59,268 INFO L226 Difference]: Without dead ends: 107 [2018-10-02 11:47:59,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:47:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-02 11:47:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-10-02 11:47:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 11:47:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-10-02 11:47:59,312 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-10-02 11:47:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:47:59,314 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-10-02 11:47:59,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:47:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-10-02 11:47:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:47:59,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:47:59,315 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:47:59,316 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:47:59,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:47:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-10-02 11:47:59,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:47:59,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:47:59,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:59,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:47:59,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:47:59,449 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-02 11:47:59,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:47:59,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:47:59,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:47:59,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:47:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:47:59,453 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-10-02 11:47:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:47:59,561 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-10-02 11:47:59,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:47:59,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:47:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:47:59,564 INFO L225 Difference]: With dead ends: 143 [2018-10-02 11:47:59,564 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 11:47:59,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-02 11:47:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 11:47:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-02 11:47:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-02 11:47:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-10-02 11:47:59,593 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-10-02 11:47:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:47:59,593 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-10-02 11:47:59,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:47:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-10-02 11:47:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:47:59,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:47:59,597 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:47:59,597 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:47:59,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:47:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-10-02 11:47:59,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:47:59,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:47:59,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:59,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:47:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:47:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:47:59,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:47:59,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:47:59,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:47:59,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:47:59,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:47:59,720 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-10-02 11:47:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:47:59,784 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-10-02 11:47:59,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:47:59,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-02 11:47:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:47:59,786 INFO L225 Difference]: With dead ends: 249 [2018-10-02 11:47:59,787 INFO L226 Difference]: Without dead ends: 167 [2018-10-02 11:47:59,788 INFO L605 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-10-02 11:47:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-02 11:47:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-02 11:47:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-02 11:47:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-10-02 11:47:59,836 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-10-02 11:47:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:47:59,837 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-10-02 11:47:59,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:47:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-10-02 11:47:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:47:59,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:47:59,839 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:47:59,839 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:47:59,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:47:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-10-02 11:47:59,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:47:59,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:47:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:59,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:47:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:47:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:47:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:47:59,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:47:59,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:47:59,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:47:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:47:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:47:59,941 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-10-02 11:48:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:00,061 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-10-02 11:48:00,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:00,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-02 11:48:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:00,064 INFO L225 Difference]: With dead ends: 489 [2018-10-02 11:48:00,064 INFO L226 Difference]: Without dead ends: 327 [2018-10-02 11:48:00,067 INFO L605 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-10-02 11:48:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-02 11:48:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-02 11:48:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-02 11:48:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-10-02 11:48:00,151 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-10-02 11:48:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:00,152 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-10-02 11:48:00,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-10-02 11:48:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:48:00,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:00,155 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-02 11:48:00,155 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:00,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-10-02 11:48:00,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:00,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:00,276 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-02 11:48:00,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:48:00,277 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-02 11:48:00,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:00,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:48:00,798 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-02 11:48:01,012 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-02 11:48:01,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:48:01,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-02 11:48:01,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:48:01,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:48:01,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:48:01,044 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-10-02 11:48:01,411 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-02 11:48:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:01,932 INFO L93 Difference]: Finished difference Result 537 states and 678 transitions. [2018-10-02 11:48:01,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:48:01,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-02 11:48:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:01,937 INFO L225 Difference]: With dead ends: 537 [2018-10-02 11:48:01,937 INFO L226 Difference]: Without dead ends: 311 [2018-10-02 11:48:01,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:48:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-02 11:48:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 269. [2018-10-02 11:48:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-02 11:48:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 332 transitions. [2018-10-02 11:48:02,026 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 332 transitions. Word has length 26 [2018-10-02 11:48:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:02,027 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 332 transitions. [2018-10-02 11:48:02,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:48:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 332 transitions. [2018-10-02 11:48:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:48:02,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:02,029 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-02 11:48:02,032 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:02,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:02,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1785005239, now seen corresponding path program 2 times [2018-10-02 11:48:02,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:02,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:02,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:02,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-02 11:48:02,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:02,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:02,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:02,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:02,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:02,151 INFO L87 Difference]: Start difference. First operand 269 states and 332 transitions. Second operand 3 states. [2018-10-02 11:48:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:02,258 INFO L93 Difference]: Finished difference Result 505 states and 622 transitions. [2018-10-02 11:48:02,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:02,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-02 11:48:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:02,260 INFO L225 Difference]: With dead ends: 505 [2018-10-02 11:48:02,261 INFO L226 Difference]: Without dead ends: 239 [2018-10-02 11:48:02,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-02 11:48:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-02 11:48:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 213. [2018-10-02 11:48:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-02 11:48:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2018-10-02 11:48:02,314 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 26 [2018-10-02 11:48:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:02,314 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2018-10-02 11:48:02,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2018-10-02 11:48:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-02 11:48:02,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:02,320 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:02,320 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:02,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:02,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1148384469, now seen corresponding path program 3 times [2018-10-02 11:48:02,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:02,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:02,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:48:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-02 11:48:02,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:02,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:02,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:02,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:02,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:02,442 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand 3 states. [2018-10-02 11:48:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:02,473 INFO L93 Difference]: Finished difference Result 235 states and 275 transitions. [2018-10-02 11:48:02,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:02,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-02 11:48:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:02,475 INFO L225 Difference]: With dead ends: 235 [2018-10-02 11:48:02,475 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:48:02,476 INFO L605 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-10-02 11:48:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:48:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:48:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:48:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:48:02,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-10-02 11:48:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:02,477 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:48:02,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:48:02,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:48:02,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:48:02,746 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-02 11:48:03,098 WARN L178 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-02 11:48:03,389 WARN L178 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-10-02 11:48:03,647 INFO L421 ceAbstractionStarter]: At program point L353(lines 353 360) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1))) [2018-10-02 11:48:03,647 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 389) no Hoare annotation was computed. [2018-10-02 11:48:03,648 INFO L421 ceAbstractionStarter]: At program point L316(lines 310 317) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-02 11:48:03,649 INFO L421 ceAbstractionStarter]: At program point L380(lines 380 387) the Hoare annotation is: false [2018-10-02 11:48:03,649 INFO L421 ceAbstractionStarter]: At program point L281(lines 281 291) the Hoare annotation is: (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-02 11:48:03,649 INFO L421 ceAbstractionStarter]: At program point L374(lines 374 381) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= ULTIMATE.start_check_~tmp~100 1) (<= 1 ~mode4) (<= 0 ~send4) (= 0 (+ ~nomsg 1)) (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~100)) [2018-10-02 11:48:03,650 INFO L421 ceAbstractionStarter]: At program point L339(lines 330 340) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (<= 1 ~mode1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p4_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1))) [2018-10-02 11:48:03,650 INFO L421 ceAbstractionStarter]: At program point L364(lines 359 365) the Hoare annotation is: (and (<= ~r1 0) (<= ULTIMATE.start_check_~tmp~100 1) (<= 1 ~mode4) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~100)) [2018-10-02 11:48:03,650 INFO L421 ceAbstractionStarter]: At program point L296(lines 290 297) the Hoare annotation is: (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-02 11:48:03,650 INFO L421 ceAbstractionStarter]: At program point L261(lines 261 272) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 (<= 1 ~mode4) (<= 1 ~mode1) .cse1 (<= ~mode1 1) .cse2 (<= ~mode4 1) (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse3))) [2018-10-02 11:48:03,651 INFO L421 ceAbstractionStarter]: At program point L321(lines 321 331) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-02 11:48:03,651 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 389) no Hoare annotation was computed. [2018-10-02 11:48:03,651 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 389) no Hoare annotation was computed. [2018-10-02 11:48:03,651 INFO L421 ceAbstractionStarter]: At program point L276(lines 271 277) the Hoare annotation is: (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-02 11:48:03,651 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 388) no Hoare annotation was computed. [2018-10-02 11:48:03,652 INFO L421 ceAbstractionStarter]: At program point L301(lines 301 311) the Hoare annotation is: (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-02 11:48:03,652 INFO L421 ceAbstractionStarter]: At program point L386(lines 254 386) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 (<= 1 ~mode4) (<= 1 ~mode1) .cse1 (<= ~mode1 1) .cse2 (<= ~mode4 1) (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse3))) [2018-10-02 11:48:03,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,664 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,664 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,664 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,674 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,681 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,681 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,690 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,690 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,691 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,691 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,704 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,704 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,704 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,705 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,713 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,713 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,713 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,713 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,729 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:48:03 BoogieIcfgContainer [2018-10-02 11:48:03,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:48:03,731 INFO L168 Benchmark]: Toolchain (without parser) took 6343.05 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: 372.7 MB). Peak memory consumption was 372.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:03,732 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-02 11:48:03,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.24 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-02 11:48:03,733 INFO L168 Benchmark]: Boogie Preprocessor took 44.02 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-02 11:48:03,734 INFO L168 Benchmark]: RCFGBuilder took 677.42 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-02 11:48:03,735 INFO L168 Benchmark]: TraceAbstraction took 5568.73 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: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:03,739 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.20 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 43.24 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 44.02 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 677.42 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 5568.73 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: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 388]: 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: 261]: Loop Invariant [2018-10-02 11:48:03,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((~r1 <= 0 && 1 <= ~mode4) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) - InvariantResult [Line: 254]: Loop Invariant [2018-10-02 11:48:03,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((~r1 <= 0 && 1 <= ~mode4) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) - InvariantResult [Line: 359]: Loop Invariant [2018-10-02 11:48:03,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && check_~tmp~100 <= 1) && 1 <= ~mode4) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~100 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 353]: Loop Invariant [2018-10-02 11:48:03,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && 1 <= ~mode4) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1 - InvariantResult [Line: 374]: Loop Invariant [2018-10-02 11:48:03,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((assert_~arg <= 1 && check_~tmp~100 <= 1) && 1 <= ~mode4) && 0 <= ~send4) && 0 == ~nomsg + 1) && ~r1 <= 0) && 1 <= ~mode1) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 1 <= assert_~arg) && 1 <= check_~tmp~100 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 330]: Loop Invariant [2018-10-02 11:48:03,764 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,766 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,766 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,766 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:03,767 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && 1 <= ~mode4) && 1 <= ~mode1) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1 - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 130 SDslu, 167 SDs, 0 SdLazy, 96 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=6, 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 124 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 37 NumberOfFragments, 559 HoareAnnotationTreeSize, 13 FomulaSimplifications, 634 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 6 QuantifiedInterpolants, 21974 SizeOfPredicates, 4 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 92/96 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.4.2.ufo.BOUNDED-8.pals.c_10.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-48-03-774.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-48-03-774.csv Received shutdown request...