java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:40:56,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:40:56,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:40:56,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:40:56,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:40:56,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:40:56,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:40:56,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:40:56,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:40:56,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:40:56,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:40:56,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:40:56,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:40:56,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:40:56,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:40:56,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:40:56,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:40:56,184 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:40:56,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:40:56,188 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:40:56,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:40:56,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:40:56,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:40:56,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:40:56,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:40:56,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:40:56,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:40:56,209 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:40:56,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:40:56,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:40:56,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:40:56,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:40:56,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:40:56,217 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:40:56,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:40:56,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:40:56,220 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:40:56,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:40:56,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:40:56,250 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:40:56,250 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:40:56,251 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:40:56,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:40:56,252 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:40:56,252 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:40:56,252 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:40:56,252 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:40:56,253 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:40:56,253 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:40:56,253 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:40:56,253 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:40:56,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:40:56,254 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:40:56,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:40:56,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:40:56,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:40:56,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:40:56,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:40:56,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:40:56,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:40:56,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:40:56,257 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:40:56,257 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:40:56,258 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:40:56,258 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:40:56,258 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:40:56,258 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:40:56,259 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:40:56,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:40:56,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:40:56,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:40:56,355 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:40:56,355 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:40:56,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl [2018-10-04 09:40:56,357 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl' [2018-10-04 09:40:56,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:40:56,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:40:56,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:40:56,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:40:56,444 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:40:56,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:40:56,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:40:56,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:40:56,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:40:56,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... [2018-10-04 09:40:56,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:40:56,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:40:56,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:40:56,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:40:56,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:40:56,606 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 09:40:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:40:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:40:57,207 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:40:57,207 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:40:57 BoogieIcfgContainer [2018-10-04 09:40:57,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:40:57,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:40:57,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:40:57,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:40:57,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:56" (1/2) ... [2018-10-04 09:40:57,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd93ead and model type pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:40:57, skipping insertion in model container [2018-10-04 09:40:57,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:40:57" (2/2) ... [2018-10-04 09:40:57,216 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl [2018-10-04 09:40:57,226 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:40:57,234 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:40:57,279 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:40:57,280 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:40:57,280 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:40:57,280 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:40:57,280 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:40:57,280 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:40:57,280 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:40:57,281 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:40:57,281 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:40:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-04 09:40:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:40:57,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:57,303 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:57,304 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:57,310 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-10-04 09:40:57,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:57,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:57,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:57,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:57,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:40:57,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:57,598 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:57,600 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-04 09:40:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:57,662 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2018-10-04 09:40:57,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:57,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:40:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:57,676 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:40:57,676 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:40:57,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:40:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 09:40:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 09:40:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-10-04 09:40:57,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2018-10-04 09:40:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:57,718 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-10-04 09:40:57,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-10-04 09:40:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:40:57,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:57,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:57,720 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:57,720 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash 391728025, now seen corresponding path program 1 times [2018-10-04 09:40:57,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:57,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:57,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:57,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:57,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:40:57,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:57,853 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:57,853 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. [2018-10-04 09:40:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:57,900 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2018-10-04 09:40:57,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:57,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:40:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:57,902 INFO L225 Difference]: With dead ends: 63 [2018-10-04 09:40:57,902 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:40:57,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:40:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-10-04 09:40:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 09:40:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-10-04 09:40:57,915 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 16 [2018-10-04 09:40:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:57,915 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-10-04 09:40:57,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2018-10-04 09:40:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:40:57,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:57,917 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:57,917 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:57,918 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:57,918 INFO L82 PathProgramCache]: Analyzing trace with hash 448986327, now seen corresponding path program 1 times [2018-10-04 09:40:57,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:57,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:57,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:57,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:57,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:58,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:40:58,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:40:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:40:58,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:58,042 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 4 states. [2018-10-04 09:40:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:58,181 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2018-10-04 09:40:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:40:58,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 09:40:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:58,184 INFO L225 Difference]: With dead ends: 87 [2018-10-04 09:40:58,184 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 09:40:58,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 09:40:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 09:40:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2018-10-04 09:40:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 09:40:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2018-10-04 09:40:58,202 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 16 [2018-10-04 09:40:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:58,202 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2018-10-04 09:40:58,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:40:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2018-10-04 09:40:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:40:58,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:58,204 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:58,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:58,205 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 448926745, now seen corresponding path program 1 times [2018-10-04 09:40:58,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:58,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:58,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:58,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:58,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:58,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:58,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:40:58,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:40:58,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:40:58,350 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:58,350 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 4 states. [2018-10-04 09:40:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:58,530 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-10-04 09:40:58,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:40:58,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 09:40:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:58,534 INFO L225 Difference]: With dead ends: 109 [2018-10-04 09:40:58,534 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 09:40:58,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 09:40:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 09:40:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2018-10-04 09:40:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 09:40:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-10-04 09:40:58,553 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 16 [2018-10-04 09:40:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:58,553 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-10-04 09:40:58,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:40:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-10-04 09:40:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:40:58,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:58,556 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:58,557 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:58,557 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:58,557 INFO L82 PathProgramCache]: Analyzing trace with hash -619448807, now seen corresponding path program 1 times [2018-10-04 09:40:58,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:58,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:58,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:58,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:58,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:58,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:58,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:40:58,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:58,610 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:58,610 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 3 states. [2018-10-04 09:40:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:58,640 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2018-10-04 09:40:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:58,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:40:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:58,641 INFO L225 Difference]: With dead ends: 69 [2018-10-04 09:40:58,641 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:40:58,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:40:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:40:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:40:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-10-04 09:40:58,653 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2018-10-04 09:40:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:58,653 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-10-04 09:40:58,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-10-04 09:40:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:40:58,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:58,656 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:58,656 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:58,656 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash -831333387, now seen corresponding path program 1 times [2018-10-04 09:40:58,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:58,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:58,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:58,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:58,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:40:58,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:58,760 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:58,760 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 3 states. [2018-10-04 09:40:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:58,816 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2018-10-04 09:40:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:58,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:40:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:58,818 INFO L225 Difference]: With dead ends: 77 [2018-10-04 09:40:58,819 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:40:58,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:40:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:40:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:40:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-10-04 09:40:58,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 30 [2018-10-04 09:40:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:58,833 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-10-04 09:40:58,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-10-04 09:40:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:40:58,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:58,834 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:58,835 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:58,835 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1089498825, now seen corresponding path program 1 times [2018-10-04 09:40:58,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:58,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:58,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:58,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:58,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:58,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:58,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:40:58,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:58,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:58,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:58,945 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 3 states. [2018-10-04 09:40:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:58,976 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-10-04 09:40:58,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:58,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:40:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:58,979 INFO L225 Difference]: With dead ends: 77 [2018-10-04 09:40:58,979 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:40:58,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:40:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:40:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:40:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:40:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-10-04 09:40:58,994 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 30 [2018-10-04 09:40:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:58,994 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-10-04 09:40:58,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-10-04 09:40:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:40:58,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:58,997 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:58,997 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:58,997 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:58,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1482525835, now seen corresponding path program 1 times [2018-10-04 09:40:58,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:58,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:59,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:59,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:59,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:59,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:59,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:40:59,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:59,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:40:59,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:59,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:40:59,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:40:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:40:59,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:59,704 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 6 states. [2018-10-04 09:40:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:59,949 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-10-04 09:40:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:40:59,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-10-04 09:40:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:59,951 INFO L225 Difference]: With dead ends: 115 [2018-10-04 09:40:59,952 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 09:40:59,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 5 [2018-10-04 09:40:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 09:40:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-10-04 09:40:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 09:40:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-10-04 09:40:59,975 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 30 [2018-10-04 09:40:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:59,976 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-10-04 09:40:59,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:40:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-10-04 09:40:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:40:59,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:59,978 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:59,978 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:59,978 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:59,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1509754543, now seen corresponding path program 2 times [2018-10-04 09:40:59,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:59,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:59,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:59,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:59,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 09:41:00,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:00,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:41:00,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:41:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:41:00,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:00,088 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 3 states. [2018-10-04 09:41:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:00,157 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2018-10-04 09:41:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:41:00,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 09:41:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:00,159 INFO L225 Difference]: With dead ends: 127 [2018-10-04 09:41:00,159 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:41:00,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:41:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:41:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 09:41:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:41:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-10-04 09:41:00,186 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 44 [2018-10-04 09:41:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:00,186 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-10-04 09:41:00,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:41:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-10-04 09:41:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:41:00,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:00,188 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:00,189 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:00,189 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1974708173, now seen corresponding path program 1 times [2018-10-04 09:41:00,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:00,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:00,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:41:00,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 09:41:00,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:00,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:41:00,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:41:00,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:41:00,284 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:00,285 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 3 states. [2018-10-04 09:41:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:00,288 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-10-04 09:41:00,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:41:00,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 09:41:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:00,289 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:41:00,289 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:41:00,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:41:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:41:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:41:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:41:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:41:00,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-10-04 09:41:00,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:00,291 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:41:00,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:41:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:41:00,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:41:00,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:41:00,585 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:41:00,768 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-04 09:41:00,977 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-04 09:41:01,098 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-04 09:41:01,658 WARN L178 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-04 09:41:01,818 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2018-10-04 09:41:02,210 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-04 09:41:02,386 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2018-10-04 09:41:02,445 INFO L421 ceAbstractionStarter]: At program point L287(lines 281 288) the Hoare annotation is: (let ((.cse0 (<= ~mode2 1))) (or (and (<= ~r1 0) (<= 512 ~mode3) (<= 256 ~mode4) .cse0) (and .cse0 (<= ~r1 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))))) [2018-10-04 09:41:02,445 INFO L421 ceAbstractionStarter]: At program point L316(lines 316 325) the Hoare annotation is: (let ((.cse0 (<= ~mode2 1)) (.cse1 (<= ~mode3 1))) (or (and (<= ~r1 0) (<= 256 ~mode4) .cse0 .cse1 (not (= ~p3_new ~nomsg))) (and .cse0 (<= ~r1 1) .cse1 (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))))) [2018-10-04 09:41:02,445 INFO L421 ceAbstractionStarter]: At program point L250(lines 250 259) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))) (and .cse0 (<= 512 ~mode3) (<= (+ ~mode1 257) 0) (<= 256 ~mode4)))) [2018-10-04 09:41:02,445 INFO L421 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (not (= ~p3_old ~nomsg))) [2018-10-04 09:41:02,446 INFO L421 ceAbstractionStarter]: At program point L267(lines 258 268) the Hoare annotation is: (or (and (<= ~mode2 1) (<= ~r1 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= 512 ~mode3) (<= 256 ~mode4))) [2018-10-04 09:41:02,446 INFO L421 ceAbstractionStarter]: At program point L292(lines 292 305) the Hoare annotation is: (let ((.cse0 (<= ~mode2 1))) (or (and (<= ~r1 0) (<= 512 ~mode3) (<= 256 ~mode4) .cse0) (and .cse0 (<= ~r1 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))))) [2018-10-04 09:41:02,446 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 61 391) no Hoare annotation was computed. [2018-10-04 09:41:02,446 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 61 391) no Hoare annotation was computed. [2018-10-04 09:41:02,446 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-10-04 09:41:02,447 INFO L421 ceAbstractionStarter]: At program point L272(lines 272 282) the Hoare annotation is: (or (and (<= ~mode2 1) (<= ~r1 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))) (and (<= ~r1 0) (<= 512 ~mode3) (<= 256 ~mode4))) [2018-10-04 09:41:02,447 INFO L421 ceAbstractionStarter]: At program point L363(lines 363 370) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (not (= ~p3_old ~nomsg))) [2018-10-04 09:41:02,447 INFO L421 ceAbstractionStarter]: At program point L388(lines 388 389) the Hoare annotation is: false [2018-10-04 09:41:02,447 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 61 391) no Hoare annotation was computed. [2018-10-04 09:41:02,447 INFO L421 ceAbstractionStarter]: At program point L331(lines 324 332) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (not (= ~p3_new ~nomsg))) [2018-10-04 09:41:02,448 INFO L421 ceAbstractionStarter]: At program point L356(lines 352 357) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (not (= ~p3_old ~nomsg))) [2018-10-04 09:41:02,448 INFO L421 ceAbstractionStarter]: At program point L385(lines 244 385) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))) (and .cse0 (<= 512 ~mode3) (<= (+ ~mode1 257) 0) (<= 256 ~mode4)))) [2018-10-04 09:41:02,448 INFO L421 ceAbstractionStarter]: At program point L377(lines 377 386) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 |ULTIMATE.start_assert_#in~arg|) (not (= ~p3_old ~nomsg))) [2018-10-04 09:41:02,448 INFO L421 ceAbstractionStarter]: At program point L311(lines 304 312) the Hoare annotation is: (let ((.cse0 (<= ~mode2 1)) (.cse1 (<= ~mode3 1))) (or (and (<= ~r1 0) (<= 256 ~mode4) .cse0 .cse1 (not (= ~p3_new ~nomsg))) (and .cse0 (<= ~r1 1) .cse1 (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p3_old ~nomsg))))) [2018-10-04 09:41:02,449 INFO L421 ceAbstractionStarter]: At program point L373(lines 369 374) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_main_~c1~109)) (<= 1 ULTIMATE.start_check_~tmp~102) (<= ~mode2 1) (<= ~mode3 1) (<= ~mode4 1) (<= 1 |ULTIMATE.start_assert_#in~arg|) (not (= ~p3_old ~nomsg))) [2018-10-04 09:41:02,467 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:41:02 BoogieIcfgContainer [2018-10-04 09:41:02,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:41:02,468 INFO L168 Benchmark]: Toolchain (without parser) took 6026.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 298.7 MB). Peak memory consumption was 298.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:41:02,470 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:41:02,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:41:02,471 INFO L168 Benchmark]: Boogie Preprocessor took 30.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:41:02,472 INFO L168 Benchmark]: RCFGBuilder took 668.15 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:41:02,473 INFO L168 Benchmark]: TraceAbstraction took 5258.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 267.0 MB). Peak memory consumption was 267.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:41:02,479 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.23 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 64.65 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 30.13 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 668.15 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5258.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 267.0 MB). Peak memory consumption was 267.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 352]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: (((((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) || (((~r1 <= 0 && 512 <= ~mode3) && ~mode1 + 257 <= 0) && 256 <= ~mode4) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && 1 <= assert_#in~arg) && !(~p3_old == ~nomsg) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) || ((~r1 <= 0 && 512 <= ~mode3) && 256 <= ~mode4) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 256 <= ~mode4) && ~mode2 <= 1) && ~mode3 <= 1) && !(~p3_new == ~nomsg)) || (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) || (((~r1 <= 0 && 512 <= ~mode3) && ~mode1 + 257 <= 0) && 256 <= ~mode4) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && !(~p3_new == ~nomsg) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && !(0 == main_~c1~109)) && 1 <= check_~tmp~102) && ~mode2 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_#in~arg) && !(~p3_old == ~nomsg) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 512 <= ~mode3) && 256 <= ~mode4) && ~mode2 <= 1) || (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) || ((~r1 <= 0 && 512 <= ~mode3) && 256 <= ~mode4) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 256 <= ~mode4) && ~mode2 <= 1) && ~mode3 <= 1) && !(~p3_new == ~nomsg)) || (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 512 <= ~mode3) && 256 <= ~mode4) && ~mode2 <= 1) || (((((~mode2 <= 1 && ~r1 <= 1) && ~mode3 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 5.1s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 249 SDtfs, 168 SDslu, 232 SDs, 0 SdLazy, 94 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 68 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 43 NumberOfFragments, 428 HoareAnnotationTreeSize, 15 FomulaSimplifications, 553 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 192 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 15110 SizeOfPredicates, 1 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 130/140 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.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-41-02-499.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_25.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-41-02-499.csv Received shutdown request...