java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:53:22,302 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:53:22,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:53:22,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:53:22,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:53:22,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:53:22,325 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:53:22,327 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:53:22,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:53:22,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:53:22,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:53:22,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:53:22,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:53:22,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:53:22,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:53:22,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:53:22,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:53:22,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:53:22,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:53:22,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:53:22,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:53:22,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:53:22,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:53:22,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:53:22,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:53:22,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:53:22,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:53:22,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:53:22,350 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:53:22,351 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:53:22,351 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:53:22,352 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:53:22,352 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:53:22,353 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:53:22,354 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:53:22,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:53:22,355 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:53:22,371 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:53:22,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:53:22,372 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:53:22,372 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:53:22,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:53:22,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:53:22,373 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:53:22,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:53:22,374 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:53:22,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:53:22,374 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:53:22,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:53:22,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:53:22,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:53:22,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:53:22,375 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:53:22,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:53:22,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:53:22,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:53:22,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:53:22,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:53:22,377 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:53:22,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:53:22,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:53:22,377 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:53:22,377 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:53:22,378 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:53:22,378 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:53:22,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:53:22,378 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:53:22,378 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:53:22,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:53:22,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:53:22,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:53:22,440 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:53:22,441 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:53:22,441 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-10-01 00:53:22,442 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-10-01 00:53:22,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:53:22,506 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:53:22,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:53:22,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:53:22,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:53:22,530 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,545 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:53:22,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:53:22,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:53:22,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:53:22,566 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,566 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,569 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,570 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,575 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,577 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,578 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 01.10 12:53:22" (1/1) ... [2018-10-01 00:53:22,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:53:22,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:53:22,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:53:22,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:53:22,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:53:22,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:53:22,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:53:22,892 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:53:22,893 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:53:22 BoogieIcfgContainer [2018-10-01 00:53:22,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:53:22,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:53:22,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:53:22,902 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:53:22,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:22" (1/2) ... [2018-10-01 00:53:22,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2927fdfe and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:53:22, skipping insertion in model container [2018-10-01 00:53:22,904 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 01.10 12:53:22" (2/2) ... [2018-10-01 00:53:22,907 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2018-10-01 00:53:22,917 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:53:22,929 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:53:22,989 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:53:22,990 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:53:22,991 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:53:22,991 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:53:22,991 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:53:22,991 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:53:22,994 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:53:22,994 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:53:22,994 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:53:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-01 00:53:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:53:23,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:23,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:53:23,033 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:23,041 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-01 00:53:23,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:23,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:23,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:23,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:23,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:23,336 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:53:23,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:53:23,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:53:23,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:53:23,360 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:23,363 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-01 00:53:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:23,578 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-01 00:53:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:53:23,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-01 00:53:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:23,592 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:53:23,592 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:53:23,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:53:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:53:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:53:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:53:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 00:53:23,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-01 00:53:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:23,638 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 00:53:23,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:53:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 00:53:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:53:23,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:23,639 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-01 00:53:23,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:23,640 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-01 00:53:23,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:23,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:23,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:23,754 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:23,754 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:23,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:23,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:23,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:23,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:53:23,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:53:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:53:23,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:23,939 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-01 00:53:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:24,074 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-01 00:53:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:53:24,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-01 00:53:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:24,076 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:53:24,076 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:53:24,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:53:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:53:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:53:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:53:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:53:24,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-01 00:53:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:24,081 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:53:24,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:53:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:53:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:53:24,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:24,083 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-01 00:53:24,083 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:24,083 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-01 00:53:24,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:24,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:24,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:24,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:24,184 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-10-01 00:53:24,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:53:24,228 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:53:24,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:24,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:24,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:24,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:53:24,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:53:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:53:24,370 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:24,370 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-01 00:53:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:24,884 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-01 00:53:24,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:53:24,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-01 00:53:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:24,886 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:53:24,886 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:53:24,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:53:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:53:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:53:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:53:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:53:24,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-01 00:53:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:24,892 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:53:24,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:53:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:53:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:53:24,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:24,893 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-01 00:53:24,893 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:24,894 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-01 00:53:24,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:24,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:24,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:24,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:24,980 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:24,980 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-10-01 00:53:24,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:53:25,008 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:53:25,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:25,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:25,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:25,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:53:25,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:53:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:53:25,103 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:25,103 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-01 00:53:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:25,424 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-01 00:53:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:53:25,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-01 00:53:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:25,427 INFO L225 Difference]: With dead ends: 15 [2018-10-01 00:53:25,427 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:53:25,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:53:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:53:25,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 00:53:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:53:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 00:53:25,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-01 00:53:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:25,431 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-01 00:53:25,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:53:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 00:53:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:53:25,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:25,432 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-01 00:53:25,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:25,433 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:25,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-01 00:53:25,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:25,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:25,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:25,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:25,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:25,622 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:25,622 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-10-01 00:53:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:53:25,639 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:53:25,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:25,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:25,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:25,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:53:25,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:53:25,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:53:25,753 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:25,753 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-01 00:53:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:26,274 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-01 00:53:26,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:53:26,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-01 00:53:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:26,276 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:53:26,276 INFO L226 Difference]: Without dead ends: 15 [2018-10-01 00:53:26,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:53:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-01 00:53:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-01 00:53:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 00:53:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-01 00:53:26,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-01 00:53:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:26,281 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-01 00:53:26,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:53:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-01 00:53:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:53:26,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:26,282 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-01 00:53:26,283 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:26,283 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-01 00:53:26,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:26,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:26,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:26,479 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:26,479 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-10-01 00:53:26,489 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:53:26,515 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:53:26,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:26,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:26,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:26,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:53:26,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:53:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:53:26,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:26,591 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-01 00:53:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:26,956 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-01 00:53:26,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:53:26,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-01 00:53:26,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:26,959 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:53:26,959 INFO L226 Difference]: Without dead ends: 17 [2018-10-01 00:53:26,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:53:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-01 00:53:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-01 00:53:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:53:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 00:53:26,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-01 00:53:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:26,967 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 00:53:26,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:53:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 00:53:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:53:26,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:26,968 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-01 00:53:26,968 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:26,968 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-01 00:53:26,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:26,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:26,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:27,317 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:27,317 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-10-01 00:53:27,333 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:53:27,384 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:53:27,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:27,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:27,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:27,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:53:27,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:53:27,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:53:27,497 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:27,497 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-01 00:53:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:27,791 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-01 00:53:27,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:53:27,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:53:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:27,795 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:53:27,796 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:53:27,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:53:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:53:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:53:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:53:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-01 00:53:27,801 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-01 00:53:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:27,801 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-01 00:53:27,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:53:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-01 00:53:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:53:27,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:27,802 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-01 00:53:27,803 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:27,803 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-01 00:53:27,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:27,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:27,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:27,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:27,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:28,099 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:28,099 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-10-01 00:53:28,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:28,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:28,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:28,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:53:28,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:53:28,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:53:28,274 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:28,274 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-01 00:53:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:28,825 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-01 00:53:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:53:28,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-01 00:53:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:28,827 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:53:28,827 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:53:28,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:53:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:53:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 00:53:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:53:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 00:53:28,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-01 00:53:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:28,833 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 00:53:28,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:53:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 00:53:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:53:28,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:28,834 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-01 00:53:28,834 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:28,835 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-01 00:53:28,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:28,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:28,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:29,072 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:29,073 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-10-01 00:53:29,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:53:29,098 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:53:29,098 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:29,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:29,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:29,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:53:29,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:53:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:53:29,185 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:29,185 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-01 00:53:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:29,585 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-01 00:53:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:53:29,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:53:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:29,587 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:53:29,587 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:53:29,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:53:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:53:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:53:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:53:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-01 00:53:29,594 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-01 00:53:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:29,594 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-01 00:53:29,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:53:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-01 00:53:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:53:29,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:29,595 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-01 00:53:29,596 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:29,596 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-01 00:53:29,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:29,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:29,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:29,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:29,895 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-10-01 00:53:29,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:53:29,949 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:53:29,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:29,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:30,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:30,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:53:30,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:53:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:53:30,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:30,032 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-01 00:53:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:30,559 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-01 00:53:30,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:53:30,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-01 00:53:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:30,561 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:53:30,561 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:53:30,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:53:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:53:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 00:53:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:53:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 00:53:30,565 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-01 00:53:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:30,566 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-01 00:53:30,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:53:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 00:53:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:53:30,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:30,566 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-01 00:53:30,567 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:30,567 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:30,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-01 00:53:30,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:30,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:30,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:30,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:30,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:30,855 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:30,855 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-10-01 00:53:30,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:53:30,874 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:53:30,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:30,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:31,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:31,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:53:31,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:53:31,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:53:31,070 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:31,070 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-01 00:53:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:31,899 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-01 00:53:31,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:53:31,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-01 00:53:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:31,901 INFO L225 Difference]: With dead ends: 29 [2018-10-01 00:53:31,901 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:53:31,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:53:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:53:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:53:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:53:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 00:53:31,906 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-01 00:53:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:31,907 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-01 00:53:31,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:53:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 00:53:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:53:31,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:31,908 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-01 00:53:31,908 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:31,908 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:31,908 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-01 00:53:31,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:31,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:31,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:32,091 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:32,091 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-10-01 00:53:32,098 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:53:35,113 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:53:35,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:35,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:35,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:35,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:53:35,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:53:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:53:35,350 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:35,350 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-01 00:53:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:35,996 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-01 00:53:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:53:35,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-01 00:53:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:35,999 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:53:35,999 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:53:35,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:53:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:53:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 00:53:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:53:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 00:53:36,003 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-01 00:53:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:36,004 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-01 00:53:36,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:53:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 00:53:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:53:36,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:36,005 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-01 00:53:36,005 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:36,005 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:36,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-01 00:53:36,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:36,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:36,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:36,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:36,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:36,309 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:36,309 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-10-01 00:53:36,317 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:53:36,431 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:53:36,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:36,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:36,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:36,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:53:36,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:53:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:53:36,578 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:36,578 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-01 00:53:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:37,280 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-01 00:53:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:53:37,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-01 00:53:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:37,282 INFO L225 Difference]: With dead ends: 33 [2018-10-01 00:53:37,282 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:53:37,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:53:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:53:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 00:53:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:53:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 00:53:37,288 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-01 00:53:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:37,288 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-01 00:53:37,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:53:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 00:53:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:53:37,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:37,289 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-01 00:53:37,289 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:37,289 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-01 00:53:37,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:37,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:37,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:37,675 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:37,675 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-10-01 00:53:37,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:37,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:37,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:37,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:53:37,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:53:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:53:37,926 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:37,926 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-01 00:53:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:38,954 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-01 00:53:38,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:53:38,955 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-01 00:53:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:38,956 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:53:38,956 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:53:38,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:53:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:53:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 00:53:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:53:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 00:53:38,964 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-01 00:53:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:38,965 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-01 00:53:38,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:53:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 00:53:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:53:38,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:38,966 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-01 00:53:38,966 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:38,966 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-01 00:53:38,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:38,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:39,552 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:39,552 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-10-01 00:53:39,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:53:39,578 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:53:39,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:39,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:40,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:40,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:53:40,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:53:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:53:40,164 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:40,164 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-01 00:53:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:41,265 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-01 00:53:41,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:53:41,266 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-01 00:53:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:41,267 INFO L225 Difference]: With dead ends: 37 [2018-10-01 00:53:41,267 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:53:41,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:53:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:53:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:53:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:53:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-01 00:53:41,273 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-01 00:53:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:41,273 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-01 00:53:41,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:53:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-01 00:53:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:53:41,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:41,274 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-01 00:53:41,274 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:41,274 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-01 00:53:41,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:41,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:41,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:41,663 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:41,663 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-10-01 00:53:41,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:53:41,864 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:53:41,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:41,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:41,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:41,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:53:41,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:53:41,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:53:41,975 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:41,975 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-01 00:53:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:42,999 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-01 00:53:43,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:53:43,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-01 00:53:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:43,002 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:53:43,002 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:53:43,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:53:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:53:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 00:53:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:53:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 00:53:43,008 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-01 00:53:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:43,008 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 00:53:43,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:53:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 00:53:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:53:43,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:43,010 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-01 00:53:43,010 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:43,010 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:43,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-01 00:53:43,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:43,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:43,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:43,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:43,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 00:53:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 00:53:43,045 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-01 00:53:43,068 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:53:43 BoogieIcfgContainer [2018-10-01 00:53:43,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:53:43,069 INFO L168 Benchmark]: Toolchain (without parser) took 20566.37 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 129.0 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Peak memory consumption was 292.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:53:43,071 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-10-01 00:53:43,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.98 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-10-01 00:53:43,073 INFO L168 Benchmark]: Boogie Preprocessor took 26.88 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-10-01 00:53:43,073 INFO L168 Benchmark]: RCFGBuilder took 312.35 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-10-01 00:53:43,074 INFO L168 Benchmark]: TraceAbstraction took 20174.14 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 129.0 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 142.5 MB). Peak memory consumption was 271.4 MB. Max. memory is 7.1 GB. [2018-10-01 00:53:43,078 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.98 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 26.88 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 312.35 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 20174.14 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 129.0 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 142.5 MB). Peak memory consumption was 271.4 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, 20.0s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 9.2s 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.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 285 SyntacticMatches, 16 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 6.0s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-53-43-099.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-53-43-099.csv Received shutdown request...