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/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:40:39,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:40:39,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:40:39,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:40:39,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:40:39,446 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:40:39,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:40:39,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:40:39,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:40:39,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:40:39,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:40:39,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:40:39,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:40:39,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:40:39,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:40:39,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:40:39,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:40:39,468 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:40:39,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:40:39,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:40:39,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:40:39,483 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:40:39,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:40:39,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:40:39,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:40:39,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:40:39,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:40:39,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:40:39,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:40:39,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:40:39,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:40:39,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:40:39,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:40:39,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:40:39,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:40:39,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:40:39,497 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-09-23 19:40:39,511 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:40:39,511 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:40:39,512 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:40:39,512 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:40:39,513 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:40:39,513 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:40:39,513 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:40:39,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:40:39,514 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:40:39,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:40:39,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:40:39,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:40:39,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:40:39,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:40:39,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:40:39,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:40:39,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:40:39,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:40:39,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:40:39,516 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:40:39,516 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:40:39,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:40:39,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:40:39,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:40:39,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:40:39,517 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:40:39,517 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:40:39,517 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:40:39,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:40:39,518 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:40:39,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:40:39,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:40:39,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:40:39,591 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:40:39,592 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:40:39,592 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2018-09-23 19:40:39,593 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-09-23 19:40:39,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:40:39,671 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:40:39,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:40:39,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:40:39,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:40:39,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:40:39,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:40:39,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:40:39,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:40:39,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/1) ... [2018-09-23 19:40:39,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:40:39,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:40:39,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:40:39,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:40:39,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (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-09-23 19:40:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 19:40:39,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 19:40:40,030 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 19:40:40,031 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:40:40 BoogieIcfgContainer [2018-09-23 19:40:40,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:40:40,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:40:40,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:40:40,036 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:40:40,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:39" (1/2) ... [2018-09-23 19:40:40,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df625ea and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:40:40, skipping insertion in model container [2018-09-23 19:40:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:40:40" (2/2) ... [2018-09-23 19:40:40,039 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2018-09-23 19:40:40,049 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:40:40,057 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:40:40,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:40:40,108 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:40:40,108 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:40:40,109 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:40:40,109 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:40:40,109 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:40:40,109 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:40:40,109 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:40:40,110 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:40:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-23 19:40:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-23 19:40:40,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:40,132 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-23 19:40:40,133 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:40,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:40,140 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-23 19:40:40,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:40,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:40,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:40,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:40,309 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:40:40,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:40:40,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:40:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:40:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:40:40,329 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-23 19:40:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:40,387 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-23 19:40:40,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:40:40,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-23 19:40:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:40,400 INFO L225 Difference]: With dead ends: 11 [2018-09-23 19:40:40,400 INFO L226 Difference]: Without dead ends: 7 [2018-09-23 19:40:40,404 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-09-23 19:40:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-23 19:40:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-23 19:40:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-23 19:40:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-23 19:40:40,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-23 19:40:40,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:40,447 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-23 19:40:40,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:40:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-23 19:40:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-23 19:40:40,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:40,449 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-23 19:40:40,449 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:40,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:40,450 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-09-23 19:40:40,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:40,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:40,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:40,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:40,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:40,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:40,650 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-09-23 19:40:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:40,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:40,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:40,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-23 19:40:40,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:40:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:40:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:40:40,738 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-09-23 19:40:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:40,800 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-23 19:40:40,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:40:40,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-23 19:40:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:40,804 INFO L225 Difference]: With dead ends: 11 [2018-09-23 19:40:40,805 INFO L226 Difference]: Without dead ends: 9 [2018-09-23 19:40:40,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:40:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-23 19:40:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-23 19:40:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-23 19:40:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-23 19:40:40,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-23 19:40:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:40,810 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-23 19:40:40,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:40:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-23 19:40:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:40:40,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:40,811 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-23 19:40:40,811 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:40,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-09-23 19:40:40,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:40,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:40,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:40,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:40,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:40,961 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:40,961 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:40,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:40:40,994 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:40:40,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:40,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:41,031 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:41,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-23 19:40:41,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:40:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:40:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:40:41,032 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-09-23 19:40:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:41,105 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-23 19:40:41,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:40:41,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-23 19:40:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:41,106 INFO L225 Difference]: With dead ends: 13 [2018-09-23 19:40:41,106 INFO L226 Difference]: Without dead ends: 11 [2018-09-23 19:40:41,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:40:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-23 19:40:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-23 19:40:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-23 19:40:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-23 19:40:41,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-23 19:40:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:41,112 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-23 19:40:41,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:40:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-23 19:40:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-23 19:40:41,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:41,114 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-23 19:40:41,114 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:41,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-09-23 19:40:41,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:41,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:41,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:41,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:41,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:41,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:41,494 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:41,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:40:41,540 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-23 19:40:41,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:41,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:41,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:41,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-23 19:40:41,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 19:40:41,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 19:40:41,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:40:41,584 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-09-23 19:40:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:41,629 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-23 19:40:41,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 19:40:41,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-23 19:40:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:41,631 INFO L225 Difference]: With dead ends: 15 [2018-09-23 19:40:41,632 INFO L226 Difference]: Without dead ends: 13 [2018-09-23 19:40:41,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:40:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-23 19:40:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-23 19:40:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-23 19:40:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-23 19:40:41,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-23 19:40:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:41,637 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-23 19:40:41,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 19:40:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-23 19:40:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:40:41,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:41,638 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-23 19:40:41,639 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:41,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:41,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-09-23 19:40:41,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:41,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:41,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:41,793 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:41,793 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:41,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:40:41,839 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:40:41,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:41,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:41,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:41,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-23 19:40:41,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:40:41,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:40:41,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:40:41,940 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-09-23 19:40:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:42,007 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-23 19:40:42,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:40:42,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-23 19:40:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:42,009 INFO L225 Difference]: With dead ends: 17 [2018-09-23 19:40:42,009 INFO L226 Difference]: Without dead ends: 15 [2018-09-23 19:40:42,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:40:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-23 19:40:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-23 19:40:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-23 19:40:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-23 19:40:42,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-23 19:40:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:42,014 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-23 19:40:42,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:40:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-23 19:40:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-23 19:40:42,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:42,016 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-23 19:40:42,016 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:42,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-09-23 19:40:42,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:42,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:42,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:42,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:42,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:42,195 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:42,195 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:42,211 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:40:42,238 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-23 19:40:42,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:42,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:42,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:42,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:40:42,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:40:42,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:40:42,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:40:42,317 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-09-23 19:40:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:42,445 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-23 19:40:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 19:40:42,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-23 19:40:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:42,448 INFO L225 Difference]: With dead ends: 19 [2018-09-23 19:40:42,449 INFO L226 Difference]: Without dead ends: 17 [2018-09-23 19:40:42,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:40:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-23 19:40:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-23 19:40:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-23 19:40:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-23 19:40:42,462 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-23 19:40:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:42,462 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-23 19:40:42,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:40:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-23 19:40:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:40:42,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:42,466 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-23 19:40:42,466 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:42,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-09-23 19:40:42,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:42,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:42,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:42,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:42,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:42,842 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:40:42,861 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-23 19:40:42,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:42,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:42,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:42,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-23 19:40:42,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:40:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:40:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:40:42,919 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-09-23 19:40:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:43,026 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-23 19:40:43,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:40:43,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-23 19:40:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:43,030 INFO L225 Difference]: With dead ends: 21 [2018-09-23 19:40:43,030 INFO L226 Difference]: Without dead ends: 19 [2018-09-23 19:40:43,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:40:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-23 19:40:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-23 19:40:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-23 19:40:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-23 19:40:43,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-23 19:40:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:43,035 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-23 19:40:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:40:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-23 19:40:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:40:43,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:43,036 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-23 19:40:43,037 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:43,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-09-23 19:40:43,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:43,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:43,340 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:43,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:43,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:43,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:43,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:43,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-09-23 19:40:43,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 19:40:43,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 19:40:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:40:43,422 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-09-23 19:40:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:43,509 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-23 19:40:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:40:43,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-23 19:40:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:43,511 INFO L225 Difference]: With dead ends: 23 [2018-09-23 19:40:43,511 INFO L226 Difference]: Without dead ends: 21 [2018-09-23 19:40:43,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:40:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-23 19:40:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-23 19:40:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-23 19:40:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-23 19:40:43,517 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-23 19:40:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:43,518 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-23 19:40:43,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 19:40:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-23 19:40:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:40:43,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:43,519 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-23 19:40:43,519 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:43,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-09-23 19:40:43,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:43,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:43,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:43,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:43,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:40:43,822 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:40:43,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:43,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:43,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:43,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-09-23 19:40:43,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-23 19:40:43,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-23 19:40:43,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:40:43,866 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-09-23 19:40:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:44,047 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-23 19:40:44,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:40:44,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-23 19:40:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:44,049 INFO L225 Difference]: With dead ends: 25 [2018-09-23 19:40:44,050 INFO L226 Difference]: Without dead ends: 23 [2018-09-23 19:40:44,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:40:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-23 19:40:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-23 19:40:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-23 19:40:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-23 19:40:44,055 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-23 19:40:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:44,056 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-23 19:40:44,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-23 19:40:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-23 19:40:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-23 19:40:44,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:44,057 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-23 19:40:44,057 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:44,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-09-23 19:40:44,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:44,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:44,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:44,258 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:44,259 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:44,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:40:44,321 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-23 19:40:44,322 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:44,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:44,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:44,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-23 19:40:44,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-23 19:40:44,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-23 19:40:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:40:44,369 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-09-23 19:40:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:44,521 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-23 19:40:44,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:40:44,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-23 19:40:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:44,529 INFO L225 Difference]: With dead ends: 27 [2018-09-23 19:40:44,529 INFO L226 Difference]: Without dead ends: 25 [2018-09-23 19:40:44,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:40:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-23 19:40:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-23 19:40:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-23 19:40:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-23 19:40:44,535 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-23 19:40:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:44,535 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-23 19:40:44,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-23 19:40:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-23 19:40:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-23 19:40:44,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:44,536 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-23 19:40:44,537 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:44,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-09-23 19:40:44,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:44,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:44,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:44,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:44,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:44,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:44,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:44,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:40:44,888 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:40:44,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:44,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:44,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:44,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-09-23 19:40:44,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-23 19:40:44,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-23 19:40:44,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-23 19:40:44,930 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-09-23 19:40:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:45,139 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-23 19:40:45,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:40:45,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-09-23 19:40:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:45,141 INFO L225 Difference]: With dead ends: 29 [2018-09-23 19:40:45,142 INFO L226 Difference]: Without dead ends: 27 [2018-09-23 19:40:45,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-23 19:40:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-23 19:40:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-23 19:40:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-23 19:40:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-23 19:40:45,148 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-23 19:40:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:45,148 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-23 19:40:45,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-23 19:40:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-23 19:40:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-23 19:40:45,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:45,150 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-23 19:40:45,150 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:45,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-09-23 19:40:45,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:45,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:45,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:45,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:45,504 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:45,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:45,515 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:40:48,377 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-23 19:40:48,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:48,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:48,536 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:48,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-09-23 19:40:48,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-23 19:40:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-23 19:40:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:40:48,538 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-09-23 19:40:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:48,852 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-23 19:40:48,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:40:48,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-23 19:40:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:48,856 INFO L225 Difference]: With dead ends: 31 [2018-09-23 19:40:48,856 INFO L226 Difference]: Without dead ends: 29 [2018-09-23 19:40:48,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:40:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-23 19:40:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-23 19:40:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-23 19:40:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-23 19:40:48,861 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-23 19:40:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:48,862 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-23 19:40:48,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-23 19:40:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-23 19:40:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-23 19:40:48,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:48,863 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-23 19:40:48,863 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:48,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-09-23 19:40:48,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:48,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:48,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:48,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:49,141 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:49,141 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:49,150 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:40:49,280 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-23 19:40:49,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:49,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:49,347 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:49,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-09-23 19:40:49,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-23 19:40:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-23 19:40:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-23 19:40:49,348 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-09-23 19:40:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:49,633 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-23 19:40:49,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:40:49,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-09-23 19:40:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:49,634 INFO L225 Difference]: With dead ends: 33 [2018-09-23 19:40:49,634 INFO L226 Difference]: Without dead ends: 31 [2018-09-23 19:40:49,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-23 19:40:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-23 19:40:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-23 19:40:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-23 19:40:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-23 19:40:49,641 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-23 19:40:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:49,641 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-23 19:40:49,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-23 19:40:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-23 19:40:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 19:40:49,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:49,642 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-23 19:40:49,642 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:49,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-09-23 19:40:49,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:49,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:49,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:49,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:49,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:50,020 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:50,021 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:50,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:50,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:50,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:50,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-09-23 19:40:50,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:40:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:40:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:40:50,075 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-23 19:40:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:50,318 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-23 19:40:50,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:40:50,320 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-23 19:40:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:50,321 INFO L225 Difference]: With dead ends: 35 [2018-09-23 19:40:50,322 INFO L226 Difference]: Without dead ends: 33 [2018-09-23 19:40:50,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:40:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-23 19:40:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-23 19:40:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-23 19:40:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-23 19:40:50,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-23 19:40:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:50,329 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-23 19:40:50,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:40:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-23 19:40:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-23 19:40:50,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:50,330 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-23 19:40:50,331 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:50,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-09-23 19:40:50,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:50,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:50,859 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:50,860 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:50,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:40:50,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:40:50,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:50,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:50,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:50,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-09-23 19:40:50,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:40:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:40:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:40:50,925 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-09-23 19:40:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:51,273 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-23 19:40:51,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:40:51,273 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-09-23 19:40:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:51,274 INFO L225 Difference]: With dead ends: 37 [2018-09-23 19:40:51,275 INFO L226 Difference]: Without dead ends: 35 [2018-09-23 19:40:51,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:40:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-23 19:40:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-23 19:40:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-23 19:40:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-23 19:40:51,281 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-23 19:40:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:51,281 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-23 19:40:51,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:40:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-23 19:40:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:40:51,282 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:51,283 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-23 19:40:51,283 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:51,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-09-23 19:40:51,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:51,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:51,779 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:51,780 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:51,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:40:51,983 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-23 19:40:51,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:51,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:52,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:52,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-09-23 19:40:52,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 19:40:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 19:40:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:40:52,088 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-09-23 19:40:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:52,402 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-23 19:40:52,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:40:52,404 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-09-23 19:40:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:52,404 INFO L225 Difference]: With dead ends: 39 [2018-09-23 19:40:52,404 INFO L226 Difference]: Without dead ends: 37 [2018-09-23 19:40:52,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:40:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-23 19:40:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-23 19:40:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-23 19:40:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-23 19:40:52,409 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-23 19:40:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:52,410 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-23 19:40:52,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 19:40:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-23 19:40:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-23 19:40:52,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:52,411 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-23 19:40:52,411 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:52,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-09-23 19:40:52,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:52,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:52,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:52,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:52,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-23 19:40:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-23 19:40:52,445 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-09-23 19:40:52,469 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:40:52 BoogieIcfgContainer [2018-09-23 19:40:52,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:40:52,470 INFO L168 Benchmark]: Toolchain (without parser) took 12801.81 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 216.6 MB). Peak memory consumption was 255.9 MB. Max. memory is 7.1 GB. [2018-09-23 19:40:52,472 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:40:52,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:40:52,473 INFO L168 Benchmark]: Boogie Preprocessor took 31.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:40:52,473 INFO L168 Benchmark]: RCFGBuilder took 286.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-23 19:40:52,474 INFO L168 Benchmark]: TraceAbstraction took 12436.80 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 195.5 MB). Peak memory consumption was 234.8 MB. Max. memory is 7.1 GB. [2018-09-23 19:40:52,477 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 286.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12436.80 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 195.5 MB). Peak memory consumption was 234.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of bitwiseOr at line 48, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L19] havoc main_#res; [L20] havoc main_#t~nondet0, main_#t~nondet1, main_~x~5, main_~y~5, main_~xx~5, main_~yy~5, main_~zz~5, main_~z~5, main_~i~5; [L21] main_~x~5 := main_#t~nondet0; [L22] havoc main_#t~nondet0; [L23] main_~y~5 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~5; [L26] havoc main_~yy~5; [L27] havoc main_~zz~5; [L28] main_~z~5 := 0; [L29] main_~i~5 := 0; VAL [main_~i~5=0, main_~z~5=0] [L32] assume true; VAL [main_~i~5=0, main_~z~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1] [L32] assume true; VAL [main_~i~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2] [L32] assume true; VAL [main_~i~5=2] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3] [L32] assume true; VAL [main_~i~5=3] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4] [L32] assume true; VAL [main_~i~5=4] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5] [L32] assume true; VAL [main_~i~5=5] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6] [L32] assume true; VAL [main_~i~5=6] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7] [L32] assume true; VAL [main_~i~5=7] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8] [L32] assume true; VAL [main_~i~5=8] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9] [L32] assume true; VAL [main_~i~5=9] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10] [L32] assume true; VAL [main_~i~5=10] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11] [L32] assume true; VAL [main_~i~5=11] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12] [L32] assume true; VAL [main_~i~5=12] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13] [L32] assume true; VAL [main_~i~5=13] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14] [L32] assume true; VAL [main_~i~5=14] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15] [L32] assume true; VAL [main_~i~5=15] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16] [L32] assume true; VAL [main_~i~5=16] [L37] assume !(main_~i~5 % 4294967296 < 16); [L38] main_~xx~5 := main_~x~5 % 65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 8)), 16711935); [L41] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 4)), 252645135); [L42] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 2)), 858993459); [L43] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 1)), 1431655765); [L44] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 8)), 16711935); [L45] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 4)), 252645135); [L46] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 2)), 858993459); [L47] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 1)), 1431655765); [L48] main_~zz~5 := ~bitwiseOr(main_~xx~5, ~shiftLeft(main_~yy~5, 1)); [L49] __VERIFIER_assert_#in~cond := (if main_~z~5 % 4294967296 == main_~zz~5 % 4294967296 then 1 else 0); [L50] havoc __VERIFIER_assert_~cond; [L51] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L52] assume __VERIFIER_assert_~cond == 0; [L53] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=0, main_~z~5=1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=0, main_~z~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 12.3s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 0 SDslu, 1497 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 285 SyntacticMatches, 16 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=16, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 88115 SizeOfPredicates, 15 NumberOfNonLiveVariables, 705 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2720 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-40-52-489.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-40-52-489.csv Received shutdown request...