java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copyInit_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:57:38,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:57:38,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:57:38,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:57:38,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:57:38,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:57:38,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:57:38,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:57:38,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:57:38,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:57:38,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:57:38,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:57:38,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:57:38,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:57:38,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:57:38,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:57:38,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:57:38,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:57:38,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:57:38,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:57:38,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:57:38,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:57:38,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:57:38,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:57:38,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:57:38,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:57:38,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:57:38,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:57:38,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:57:38,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:57:38,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:57:38,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:57:38,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:57:38,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:57:38,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:57:38,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:57:38,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:57:38,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:57:38,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:57:38,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:57:38,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:57:38,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:57:38,597 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:57:38,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:57:38,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:57:38,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:57:38,602 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:57:38,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:57:38,603 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:57:38,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:57:38,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:57:38,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:57:38,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:57:38,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:57:38,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:57:38,604 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:57:38,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:57:38,605 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:57:38,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:57:38,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:57:38,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:57:38,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:57:38,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:57:38,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:57:38,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:57:38,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:57:38,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:57:38,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:57:38,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:57:38,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:57:38,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:57:38,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:57:38,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:57:38,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:57:38,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:57:38,657 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:57:38,657 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInit_ground.i [2019-10-01 22:57:38,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cc2cc9b/1d28e7f5f78c406ebd15011324e4e2d6/FLAG16137464d [2019-10-01 22:57:39,143 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:57:39,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInit_ground.i [2019-10-01 22:57:39,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cc2cc9b/1d28e7f5f78c406ebd15011324e4e2d6/FLAG16137464d [2019-10-01 22:57:39,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cc2cc9b/1d28e7f5f78c406ebd15011324e4e2d6 [2019-10-01 22:57:39,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:57:39,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:57:39,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:39,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:57:39,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:57:39,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1cd617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39, skipping insertion in model container [2019-10-01 22:57:39,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,563 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:57:39,579 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:57:39,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:39,811 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:57:39,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:39,944 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:57:39,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39 WrapperNode [2019-10-01 22:57:39,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:39,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:57:39,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:57:39,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:57:39,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:57:39,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:57:39,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:57:39,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:57:39,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:57:40,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:57:40,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:57:40,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:57:40,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:57:40,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:57:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:57:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:57:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:57:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:57:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:57:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:57:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:57:40,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:57:40,303 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:57:40,303 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:57:40,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:40 BoogieIcfgContainer [2019-10-01 22:57:40,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:57:40,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:57:40,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:57:40,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:57:40,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:57:39" (1/3) ... [2019-10-01 22:57:40,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fcfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:40, skipping insertion in model container [2019-10-01 22:57:40,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (2/3) ... [2019-10-01 22:57:40,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fcfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:40, skipping insertion in model container [2019-10-01 22:57:40,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:40" (3/3) ... [2019-10-01 22:57:40,326 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copyInit_ground.i [2019-10-01 22:57:40,347 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:57:40,362 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:57:40,389 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:57:40,418 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:57:40,418 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:57:40,419 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:57:40,419 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:57:40,419 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:57:40,419 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:57:40,419 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:57:40,420 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:57:40,420 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:57:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-01 22:57:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:57:40,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:40,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:40,449 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:40,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1085876810, now seen corresponding path program 1 times [2019-10-01 22:57:40,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:40,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:40,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:40,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:40,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:40,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:57:40,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:57:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:57:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:57:40,607 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-10-01 22:57:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:40,626 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-10-01 22:57:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:57:40,627 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 22:57:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:40,636 INFO L225 Difference]: With dead ends: 45 [2019-10-01 22:57:40,636 INFO L226 Difference]: Without dead ends: 21 [2019-10-01 22:57:40,639 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:57:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-01 22:57:40,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-01 22:57:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-01 22:57:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-01 22:57:40,677 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2019-10-01 22:57:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:40,678 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-01 22:57:40,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:57:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-01 22:57:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:57:40,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:40,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:40,681 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash -274239930, now seen corresponding path program 1 times [2019-10-01 22:57:40,684 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:40,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:40,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:40,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:40,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:40,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:57:40,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:57:40,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:57:40,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:57:40,791 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2019-10-01 22:57:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:40,824 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-10-01 22:57:40,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:57:40,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 22:57:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:40,826 INFO L225 Difference]: With dead ends: 38 [2019-10-01 22:57:40,826 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 22:57:40,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:57:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 22:57:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-01 22:57:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-01 22:57:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-01 22:57:40,834 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-10-01 22:57:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:40,835 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-01 22:57:40,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:57:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-01 22:57:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 22:57:40,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:40,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:40,837 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:40,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895644, now seen corresponding path program 1 times [2019-10-01 22:57:40,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:40,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:40,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:40,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:57:40,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:40,976 INFO L224 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) [2019-10-01 22:57:41,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:41,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:57:41,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:57:41,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:41,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:57:41,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:57:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:57:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:57:41,120 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2019-10-01 22:57:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:41,174 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-10-01 22:57:41,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:57:41,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-01 22:57:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:41,176 INFO L225 Difference]: With dead ends: 42 [2019-10-01 22:57:41,176 INFO L226 Difference]: Without dead ends: 27 [2019-10-01 22:57:41,177 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:57:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-01 22:57:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-10-01 22:57:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:57:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-01 22:57:41,184 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2019-10-01 22:57:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:41,185 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-01 22:57:41,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:57:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-01 22:57:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 22:57:41,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:41,186 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:41,186 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1615172030, now seen corresponding path program 2 times [2019-10-01 22:57:41,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:41,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:41,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:41,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:57:41,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:41,265 INFO L224 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 [2019-10-01 22:57:41,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:41,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:41,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:41,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:57:41,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:57:41,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:41,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:57:41,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:57:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:57:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:57:41,364 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-10-01 22:57:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:41,416 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-10-01 22:57:41,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:57:41,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-01 22:57:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:41,417 INFO L225 Difference]: With dead ends: 47 [2019-10-01 22:57:41,418 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:57:41,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:57:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:57:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 22:57:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:57:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-01 22:57:41,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2019-10-01 22:57:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:41,425 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-01 22:57:41,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:57:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-01 22:57:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 22:57:41,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:41,427 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:41,427 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:41,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:41,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1115557856, now seen corresponding path program 3 times [2019-10-01 22:57:41,428 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:41,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:41,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:57:41,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:41,509 INFO L224 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) [2019-10-01 22:57:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:41,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:57:41,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:41,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:57:41,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:57:41,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:41,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:57:41,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:57:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:57:41,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:41,613 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2019-10-01 22:57:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:41,683 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-10-01 22:57:41,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:57:41,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-01 22:57:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:41,684 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:57:41,685 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 22:57:41,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 22:57:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-01 22:57:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:57:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-01 22:57:41,692 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2019-10-01 22:57:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:41,692 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-01 22:57:41,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:57:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-01 22:57:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:57:41,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:41,694 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:41,694 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1574965310, now seen corresponding path program 4 times [2019-10-01 22:57:41,695 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:41,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 22:57:41,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:41,829 INFO L224 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) [2019-10-01 22:57:41,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:41,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:41,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:41,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:57:41,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 22:57:41,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:41,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:57:41,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:57:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:57:41,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:57:41,948 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2019-10-01 22:57:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:42,001 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-10-01 22:57:42,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:57:42,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-10-01 22:57:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:42,003 INFO L225 Difference]: With dead ends: 57 [2019-10-01 22:57:42,003 INFO L226 Difference]: Without dead ends: 36 [2019-10-01 22:57:42,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:57:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-01 22:57:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-01 22:57:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 22:57:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-01 22:57:42,009 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 27 [2019-10-01 22:57:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:42,009 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-01 22:57:42,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:57:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-01 22:57:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-01 22:57:42,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:42,011 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:42,011 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1364556508, now seen corresponding path program 5 times [2019-10-01 22:57:42,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:42,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:42,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:42,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 22:57:42,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:42,116 INFO L224 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 [2019-10-01 22:57:42,138 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:42,237 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:57:42,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:42,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:57:42,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:42,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:42,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:57:42,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:57:42,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:57:42,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:42,269 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 9 states. [2019-10-01 22:57:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:42,333 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-10-01 22:57:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:57:42,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-10-01 22:57:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:42,335 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:57:42,335 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:57:42,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:57:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-10-01 22:57:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-01 22:57:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-10-01 22:57:42,342 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2019-10-01 22:57:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:42,343 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-10-01 22:57:42,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:57:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-10-01 22:57:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 22:57:42,344 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:42,344 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:42,344 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2008503354, now seen corresponding path program 6 times [2019-10-01 22:57:42,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 22:57:42,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:42,477 INFO L224 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) [2019-10-01 22:57:42,509 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:42,566 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:57:42,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:42,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:57:42,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 22:57:42,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:42,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:57:42,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:57:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:57:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:42,595 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 10 states. [2019-10-01 22:57:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:42,679 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-10-01 22:57:42,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:57:42,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-10-01 22:57:42,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:42,683 INFO L225 Difference]: With dead ends: 67 [2019-10-01 22:57:42,683 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 22:57:42,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 22:57:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-10-01 22:57:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 22:57:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-01 22:57:42,694 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 33 [2019-10-01 22:57:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:42,694 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-01 22:57:42,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:57:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-01 22:57:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-01 22:57:42,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:42,696 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:42,698 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1155270616, now seen corresponding path program 7 times [2019-10-01 22:57:42,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:42,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:57:42,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:42,819 INFO L224 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) [2019-10-01 22:57:42,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:57:42,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:57:42,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:42,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:57:42,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:57:42,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:57:42,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:42,913 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 11 states. [2019-10-01 22:57:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:42,981 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-10-01 22:57:42,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:57:42,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-10-01 22:57:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:42,983 INFO L225 Difference]: With dead ends: 72 [2019-10-01 22:57:42,983 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:57:42,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:57:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-01 22:57:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:57:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-01 22:57:42,990 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2019-10-01 22:57:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:42,990 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-01 22:57:42,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:57:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-01 22:57:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 22:57:42,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:42,995 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:42,995 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2090911178, now seen corresponding path program 8 times [2019-10-01 22:57:42,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:42,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:57:43,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,173 INFO L224 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 [2019-10-01 22:57:43,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:43,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:43,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:57:43,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:57:43,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:57:43,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:57:43,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:43,263 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2019-10-01 22:57:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,340 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-01 22:57:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:57:43,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-10-01 22:57:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,341 INFO L225 Difference]: With dead ends: 77 [2019-10-01 22:57:43,342 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 22:57:43,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 22:57:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-10-01 22:57:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:57:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-10-01 22:57:43,348 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2019-10-01 22:57:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,348 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-10-01 22:57:43,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:57:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-10-01 22:57:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:57:43,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,350 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,350 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1997490476, now seen corresponding path program 9 times [2019-10-01 22:57:43,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:57:43,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,472 INFO L224 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) [2019-10-01 22:57:43,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:43,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:57:43,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:57:43,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 22:57:43,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:57:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:57:43,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:43,605 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 13 states. [2019-10-01 22:57:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,684 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2019-10-01 22:57:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:57:43,685 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2019-10-01 22:57:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,686 INFO L225 Difference]: With dead ends: 82 [2019-10-01 22:57:43,686 INFO L226 Difference]: Without dead ends: 51 [2019-10-01 22:57:43,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-01 22:57:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-10-01 22:57:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 22:57:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-01 22:57:43,704 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 42 [2019-10-01 22:57:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,704 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-01 22:57:43,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:57:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-01 22:57:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 22:57:43,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,706 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,706 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,706 INFO L82 PathProgramCache]: Analyzing trace with hash 527876658, now seen corresponding path program 10 times [2019-10-01 22:57:43,706 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 22:57:43,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,862 INFO L224 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 [2019-10-01 22:57:43,895 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:43,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:43,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 22:57:43,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:57:43,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:57:43,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:57:43,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:43,961 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2019-10-01 22:57:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:44,040 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-10-01 22:57:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:57:44,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-10-01 22:57:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:44,042 INFO L225 Difference]: With dead ends: 87 [2019-10-01 22:57:44,042 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 22:57:44,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 22:57:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-01 22:57:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 22:57:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-01 22:57:44,048 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 45 [2019-10-01 22:57:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:44,049 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-01 22:57:44,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:57:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-01 22:57:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-01 22:57:44,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:44,050 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:44,050 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1374848976, now seen corresponding path program 11 times [2019-10-01 22:57:44,051 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:44,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:44,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:44,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-01 22:57:44,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:44,261 INFO L224 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 [2019-10-01 22:57:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:45,674 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 22:57:45,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:45,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:57:45,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-01 22:57:45,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:45,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:57:45,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:57:45,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:57:45,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:45,722 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 15 states. [2019-10-01 22:57:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:45,805 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-10-01 22:57:45,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:57:45,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-10-01 22:57:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:45,807 INFO L225 Difference]: With dead ends: 92 [2019-10-01 22:57:45,807 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 22:57:45,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 22:57:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-10-01 22:57:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 22:57:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-10-01 22:57:45,813 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 48 [2019-10-01 22:57:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:45,813 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-10-01 22:57:45,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:57:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-10-01 22:57:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 22:57:45,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:45,815 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:45,815 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:45,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1289950162, now seen corresponding path program 12 times [2019-10-01 22:57:45,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:45,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:45,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:45,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:57:45,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:45,952 INFO L224 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) [2019-10-01 22:57:45,979 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:47,012 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:57:47,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:47,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:57:47,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-01 22:57:47,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:47,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 22:57:47,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:57:47,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:57:47,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:57:47,045 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 16 states. [2019-10-01 22:57:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:47,136 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-10-01 22:57:47,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:57:47,138 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-10-01 22:57:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:47,139 INFO L225 Difference]: With dead ends: 97 [2019-10-01 22:57:47,139 INFO L226 Difference]: Without dead ends: 60 [2019-10-01 22:57:47,139 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:57:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-01 22:57:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-01 22:57:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 22:57:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-01 22:57:47,145 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 51 [2019-10-01 22:57:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:47,145 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-01 22:57:47,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:57:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-01 22:57:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 22:57:47,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:47,146 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:47,146 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1556118220, now seen corresponding path program 13 times [2019-10-01 22:57:47,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:47,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:47,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-10-01 22:57:47,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:47,303 INFO L224 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 [2019-10-01 22:57:47,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:47,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:57:47,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-10-01 22:57:47,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:47,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:57:47,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:57:47,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:57:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:57:47,401 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 17 states. [2019-10-01 22:57:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:47,504 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-10-01 22:57:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:57:47,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-10-01 22:57:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:47,505 INFO L225 Difference]: With dead ends: 102 [2019-10-01 22:57:47,505 INFO L226 Difference]: Without dead ends: 63 [2019-10-01 22:57:47,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:57:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-01 22:57:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-01 22:57:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 22:57:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-01 22:57:47,514 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 54 [2019-10-01 22:57:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:47,514 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-01 22:57:47,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:57:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-01 22:57:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 22:57:47,518 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:47,518 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:47,518 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:47,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash 770750506, now seen corresponding path program 14 times [2019-10-01 22:57:47,519 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:47,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:47,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:47,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:57:47,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:47,692 INFO L224 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 [2019-10-01 22:57:47,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:47,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:47,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:47,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:57:47,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:57:47,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:47,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:57:47,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:57:47,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:57:47,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:57:47,797 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 18 states. [2019-10-01 22:57:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:47,897 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-10-01 22:57:47,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:57:47,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-10-01 22:57:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:47,899 INFO L225 Difference]: With dead ends: 107 [2019-10-01 22:57:47,899 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:57:47,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:57:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:57:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-10-01 22:57:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-01 22:57:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-10-01 22:57:47,904 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 57 [2019-10-01 22:57:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:47,905 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-10-01 22:57:47,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:57:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-10-01 22:57:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-01 22:57:47,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:47,906 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:47,906 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1363570744, now seen corresponding path program 15 times [2019-10-01 22:57:47,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:47,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-01 22:57:48,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:48,089 INFO L224 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 [2019-10-01 22:57:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:48,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:57:48,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:48,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:57:48,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:48,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:57:48,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:57:48,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:57:48,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:48,764 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 19 states. [2019-10-01 22:57:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:48,876 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2019-10-01 22:57:48,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:57:48,877 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-01 22:57:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:48,878 INFO L225 Difference]: With dead ends: 112 [2019-10-01 22:57:48,878 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:57:48,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:57:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-10-01 22:57:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 22:57:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-10-01 22:57:48,884 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 60 [2019-10-01 22:57:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:48,884 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-10-01 22:57:48,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:57:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-10-01 22:57:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 22:57:48,885 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:48,885 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:48,885 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:48,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash -938400218, now seen corresponding path program 16 times [2019-10-01 22:57:48,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:48,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-10-01 22:57:49,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:49,091 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:49,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:49,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:49,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:49,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:57:49,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 22:57:49,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:49,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:57:49,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:57:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:57:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:57:49,187 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 20 states. [2019-10-01 22:57:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:49,286 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-10-01 22:57:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:57:49,287 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2019-10-01 22:57:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:49,288 INFO L225 Difference]: With dead ends: 117 [2019-10-01 22:57:49,288 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:57:49,288 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:57:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:57:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 22:57:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:57:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-10-01 22:57:49,295 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 63 [2019-10-01 22:57:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:49,295 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-10-01 22:57:49,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:57:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-10-01 22:57:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-01 22:57:49,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:49,296 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:49,297 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:49,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1438435012, now seen corresponding path program 17 times [2019-10-01 22:57:49,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:49,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:49,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-01 22:57:49,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:49,598 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:49,621 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:58:16,157 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-01 22:58:16,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:16,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:58:16,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:58:16,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:16,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:58:16,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:58:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:58:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:58:16,205 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 21 states. [2019-10-01 22:58:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:16,342 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2019-10-01 22:58:16,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:58:16,342 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-10-01 22:58:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:16,343 INFO L225 Difference]: With dead ends: 122 [2019-10-01 22:58:16,343 INFO L226 Difference]: Without dead ends: 75 [2019-10-01 22:58:16,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:58:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-01 22:58:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-10-01 22:58:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-01 22:58:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-10-01 22:58:16,348 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 66 [2019-10-01 22:58:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:16,348 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-10-01 22:58:16,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:58:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-10-01 22:58:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 22:58:16,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:16,350 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:16,350 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1038272990, now seen corresponding path program 18 times [2019-10-01 22:58:16,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:16,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:16,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:16,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-01 22:58:16,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:16,623 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:16,651 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:58:34,766 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:58:34,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:34,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:58:34,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 18 proven. 324 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-01 22:58:34,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:34,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2019-10-01 22:58:34,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:58:34,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:58:34,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:58:34,834 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 23 states. [2019-10-01 22:58:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:34,954 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2019-10-01 22:58:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:58:34,954 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2019-10-01 22:58:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:34,957 INFO L225 Difference]: With dead ends: 133 [2019-10-01 22:58:34,957 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:58:34,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:58:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:58:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2019-10-01 22:58:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:58:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-10-01 22:58:34,971 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 69 [2019-10-01 22:58:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:34,971 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-10-01 22:58:34,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:58:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-10-01 22:58:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:58:34,972 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:34,972 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:34,973 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash 673783744, now seen corresponding path program 19 times [2019-10-01 22:58:34,973 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:34,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:34,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:34,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:34,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-01 22:58:35,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:35,220 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:35,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:35,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:58:35,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-10-01 22:58:35,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:35,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:58:35,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:58:35,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:58:35,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:58:35,319 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 23 states. [2019-10-01 22:58:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:35,465 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-10-01 22:58:35,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:58:35,468 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-10-01 22:58:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:35,469 INFO L225 Difference]: With dead ends: 132 [2019-10-01 22:58:35,469 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 22:58:35,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:58:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 22:58:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-10-01 22:58:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-01 22:58:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-10-01 22:58:35,473 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-10-01 22:58:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:35,474 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-10-01 22:58:35,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:58:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-10-01 22:58:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 22:58:35,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:35,475 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:35,475 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash 624158750, now seen corresponding path program 20 times [2019-10-01 22:58:35,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:35,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:35,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:35,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:35,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 22:58:35,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:35,770 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:35,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:58:35,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:58:35,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:35,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:58:35,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-10-01 22:58:35,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:35,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:58:35,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:58:35,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:58:35,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:58:35,909 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 24 states. [2019-10-01 22:58:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:36,022 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2019-10-01 22:58:36,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:58:36,024 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-10-01 22:58:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:36,025 INFO L225 Difference]: With dead ends: 137 [2019-10-01 22:58:36,025 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:58:36,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:58:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:58:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-10-01 22:58:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-01 22:58:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-10-01 22:58:36,031 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 75 [2019-10-01 22:58:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:36,032 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-10-01 22:58:36,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:58:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-10-01 22:58:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-01 22:58:36,033 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:36,033 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:36,033 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:36,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:36,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2065851716, now seen corresponding path program 21 times [2019-10-01 22:58:36,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:36,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:36,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:36,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:36,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-01 22:58:36,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:36,387 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:36,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:58:43,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:58:43,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:43,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:58:43,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-10-01 22:58:43,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:43,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:58:43,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:58:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:58:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:58:43,098 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 25 states. [2019-10-01 22:58:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:43,214 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2019-10-01 22:58:43,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:58:43,215 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2019-10-01 22:58:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:43,216 INFO L225 Difference]: With dead ends: 142 [2019-10-01 22:58:43,216 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 22:58:43,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:58:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 22:58:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-10-01 22:58:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-01 22:58:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-10-01 22:58:43,220 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 78 [2019-10-01 22:58:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:43,221 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-10-01 22:58:43,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:58:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-10-01 22:58:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 22:58:43,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:43,222 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:43,222 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:43,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2097923046, now seen corresponding path program 22 times [2019-10-01 22:58:43,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:43,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 22:58:43,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:43,573 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:43,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:58:43,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:58:43,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:43,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:58:43,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 22:58:43,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:43,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:58:43,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:58:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:58:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:58:43,691 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 26 states. [2019-10-01 22:58:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:43,808 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2019-10-01 22:58:43,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:58:43,809 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2019-10-01 22:58:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:43,809 INFO L225 Difference]: With dead ends: 147 [2019-10-01 22:58:43,810 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 22:58:43,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:58:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 22:58:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 22:58:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 22:58:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-10-01 22:58:43,815 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 81 [2019-10-01 22:58:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:43,815 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-10-01 22:58:43,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:58:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-10-01 22:58:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 22:58:43,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:43,816 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:43,817 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:43,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:43,817 INFO L82 PathProgramCache]: Analyzing trace with hash 322516920, now seen corresponding path program 23 times [2019-10-01 22:58:43,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:43,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:43,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:43,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:43,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:58:44,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:44,134 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:59:43,840 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 22:59:43,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:43,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:59:43,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:59:43,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 22:59:43,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:59:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:59:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:59:43,911 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 27 states. [2019-10-01 22:59:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:44,036 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2019-10-01 22:59:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:59:44,037 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2019-10-01 22:59:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:44,038 INFO L225 Difference]: With dead ends: 152 [2019-10-01 22:59:44,038 INFO L226 Difference]: Without dead ends: 93 [2019-10-01 22:59:44,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:59:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-01 22:59:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-10-01 22:59:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-01 22:59:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-10-01 22:59:44,043 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 84 [2019-10-01 22:59:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:44,043 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-10-01 22:59:44,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:59:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-10-01 22:59:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-01 22:59:44,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:44,044 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:44,045 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1250086378, now seen corresponding path program 24 times [2019-10-01 22:59:44,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:44,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:44,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:59:44,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:44,390 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:59:44,418 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:01:12,918 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:01:12,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:12,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:01:12,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 23:01:12,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:12,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:01:12,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:01:12,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:01:12,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:01:12,997 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 28 states. [2019-10-01 23:01:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:13,125 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2019-10-01 23:01:13,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:01:13,128 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2019-10-01 23:01:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:13,129 INFO L225 Difference]: With dead ends: 157 [2019-10-01 23:01:13,129 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 23:01:13,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:01:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 23:01:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 23:01:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 23:01:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-10-01 23:01:13,135 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 87 [2019-10-01 23:01:13,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:13,135 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2019-10-01 23:01:13,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:01:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2019-10-01 23:01:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-01 23:01:13,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:13,137 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:13,137 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:13,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2095384908, now seen corresponding path program 25 times [2019-10-01 23:01:13,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:13,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:13,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:13,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:13,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-01 23:01:13,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:13,500 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:13,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:01:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:13,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:01:13,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-01 23:01:13,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:13,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:01:13,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:01:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:01:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:01:13,601 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 29 states. [2019-10-01 23:01:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:13,752 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2019-10-01 23:01:13,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:01:13,754 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2019-10-01 23:01:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:13,755 INFO L225 Difference]: With dead ends: 162 [2019-10-01 23:01:13,755 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 23:01:13,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:01:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 23:01:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-10-01 23:01:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 23:01:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-10-01 23:01:13,761 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 90 [2019-10-01 23:01:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:13,761 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-10-01 23:01:13,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:01:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-10-01 23:01:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 23:01:13,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:13,762 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:13,763 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1620194798, now seen corresponding path program 26 times [2019-10-01 23:01:13,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:13,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:13,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:01:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-01 23:01:14,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:14,250 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:14,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:01:14,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:01:14,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:14,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:01:14,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-01 23:01:14,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:14,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:01:14,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:01:14,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:01:14,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:01:14,373 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 30 states. [2019-10-01 23:01:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:14,528 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2019-10-01 23:01:14,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:01:14,529 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2019-10-01 23:01:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:14,530 INFO L225 Difference]: With dead ends: 167 [2019-10-01 23:01:14,531 INFO L226 Difference]: Without dead ends: 102 [2019-10-01 23:01:14,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:01:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-01 23:01:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-10-01 23:01:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-01 23:01:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-10-01 23:01:14,536 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 93 [2019-10-01 23:01:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:14,536 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-10-01 23:01:14,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:01:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-10-01 23:01:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 23:01:14,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:14,538 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:14,538 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1289869232, now seen corresponding path program 27 times [2019-10-01 23:01:14,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:14,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:14,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:14,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-10-01 23:01:14,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:14,954 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:15,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:01:48,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:01:48,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:48,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:01:48,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-10-01 23:01:48,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:48,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:01:48,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:01:48,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:01:48,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:01:48,804 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 31 states. [2019-10-01 23:01:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:48,986 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2019-10-01 23:01:48,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:01:48,986 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 96 [2019-10-01 23:01:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:48,987 INFO L225 Difference]: With dead ends: 172 [2019-10-01 23:01:48,987 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 23:01:48,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:01:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 23:01:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-10-01 23:01:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 23:01:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-10-01 23:01:48,993 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 96 [2019-10-01 23:01:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:48,994 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-10-01 23:01:48,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:01:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-10-01 23:01:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 23:01:48,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:48,995 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:48,995 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash -337312754, now seen corresponding path program 28 times [2019-10-01 23:01:48,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:48,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:48,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 23:01:49,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:49,499 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:49,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:01:49,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:01:49,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:49,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:01:49,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:01:49,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:49,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:01:49,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:01:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:01:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:01:49,626 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 32 states. [2019-10-01 23:01:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:49,771 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2019-10-01 23:01:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:01:49,771 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2019-10-01 23:01:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:49,772 INFO L225 Difference]: With dead ends: 177 [2019-10-01 23:01:49,772 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 23:01:49,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:01:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 23:01:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 23:01:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 23:01:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-10-01 23:01:49,777 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 99 [2019-10-01 23:01:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:49,778 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2019-10-01 23:01:49,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:01:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2019-10-01 23:01:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 23:01:49,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:49,779 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:49,779 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1902959276, now seen corresponding path program 29 times [2019-10-01 23:01:49,780 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:49,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:49,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-10-01 23:01:50,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:50,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:50,327 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:03:48,814 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 23:03:48,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:03:48,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:03:48,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:03:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-10-01 23:03:48,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:03:48,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:03:48,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:03:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:03:48,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:03:48,940 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 33 states. [2019-10-01 23:03:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:03:49,172 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2019-10-01 23:03:49,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:03:49,173 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2019-10-01 23:03:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:03:49,176 INFO L225 Difference]: With dead ends: 182 [2019-10-01 23:03:49,176 INFO L226 Difference]: Without dead ends: 111 [2019-10-01 23:03:49,177 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:03:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-01 23:03:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-10-01 23:03:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 23:03:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-10-01 23:03:49,186 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 102 [2019-10-01 23:03:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:03:49,187 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-10-01 23:03:49,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:03:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-10-01 23:03:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-01 23:03:49,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:03:49,188 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:03:49,189 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:03:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:03:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash -830349302, now seen corresponding path program 30 times [2019-10-01 23:03:49,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:03:49,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:03:49,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:49,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:03:49,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:03:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-10-01 23:03:49,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:03:49,834 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:03:49,901 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:06:27,804 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-01 23:06:27,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:06:27,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:06:27,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:06:27,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:27,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 23:06:27,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:06:27,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:06:27,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:06:27,911 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 34 states. [2019-10-01 23:06:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:28,043 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2019-10-01 23:06:28,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:06:28,044 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 105 [2019-10-01 23:06:28,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:28,045 INFO L225 Difference]: With dead ends: 187 [2019-10-01 23:06:28,045 INFO L226 Difference]: Without dead ends: 114 [2019-10-01 23:06:28,046 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:06:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-01 23:06:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-10-01 23:06:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-01 23:06:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2019-10-01 23:06:28,058 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 105 [2019-10-01 23:06:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:28,058 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2019-10-01 23:06:28,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:06:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2019-10-01 23:06:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 23:06:28,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:28,059 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:28,059 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash 974847912, now seen corresponding path program 31 times [2019-10-01 23:06:28,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:28,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:28,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:28,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:06:28,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-10-01 23:06:28,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:28,723 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:06:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:06:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:28,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:06:28,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-10-01 23:06:28,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:28,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:06:28,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:06:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:06:28,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:06:28,847 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 35 states. [2019-10-01 23:06:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:29,042 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2019-10-01 23:06:29,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:06:29,043 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2019-10-01 23:06:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:29,044 INFO L225 Difference]: With dead ends: 192 [2019-10-01 23:06:29,044 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 23:06:29,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:06:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 23:06:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-10-01 23:06:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-01 23:06:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-10-01 23:06:29,051 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 108 [2019-10-01 23:06:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:29,051 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-10-01 23:06:29,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:06:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-10-01 23:06:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-01 23:06:29,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:29,052 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:29,052 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1016898042, now seen corresponding path program 32 times [2019-10-01 23:06:29,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:29,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:29,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:29,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:06:29,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-10-01 23:06:29,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:29,556 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:06:29,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:06:29,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:06:29,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:06:29,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:06:29,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-10-01 23:06:29,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:29,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:06:29,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:06:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:06:29,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:06:29,685 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 36 states. [2019-10-01 23:06:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:29,850 INFO L93 Difference]: Finished difference Result 197 states and 202 transitions. [2019-10-01 23:06:29,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:06:29,851 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 111 [2019-10-01 23:06:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:29,852 INFO L225 Difference]: With dead ends: 197 [2019-10-01 23:06:29,852 INFO L226 Difference]: Without dead ends: 120 [2019-10-01 23:06:29,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:06:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-01 23:06:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-10-01 23:06:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 23:06:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-10-01 23:06:29,859 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 111 [2019-10-01 23:06:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:29,859 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-10-01 23:06:29,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:06:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-10-01 23:06:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-01 23:06:29,860 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:29,860 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:29,860 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:29,860 INFO L82 PathProgramCache]: Analyzing trace with hash -120895836, now seen corresponding path program 33 times [2019-10-01 23:06:29,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:29,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:29,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:29,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:06:29,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-10-01 23:06:30,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:30,387 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:06:30,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:07:31,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-01 23:07:31,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:31,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:07:31,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-10-01 23:07:31,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:31,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 23:07:31,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:07:31,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:07:31,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:07:31,892 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 37 states. [2019-10-01 23:07:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:32,120 INFO L93 Difference]: Finished difference Result 202 states and 207 transitions. [2019-10-01 23:07:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:07:32,121 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2019-10-01 23:07:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:32,122 INFO L225 Difference]: With dead ends: 202 [2019-10-01 23:07:32,122 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 23:07:32,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:07:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 23:07:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-10-01 23:07:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-01 23:07:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-10-01 23:07:32,127 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 114 [2019-10-01 23:07:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:32,128 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-10-01 23:07:32,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:07:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-10-01 23:07:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:07:32,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:32,129 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:32,129 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1328053762, now seen corresponding path program 34 times [2019-10-01 23:07:32,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:32,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:32,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-10-01 23:07:32,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:32,660 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:07:32,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:07:32,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:07:32,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:32,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:07:32,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:07:32,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:32,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:07:32,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:07:32,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:07:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:07:32,844 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 38 states. [2019-10-01 23:07:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:33,038 INFO L93 Difference]: Finished difference Result 207 states and 212 transitions. [2019-10-01 23:07:33,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:07:33,038 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 117 [2019-10-01 23:07:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:33,039 INFO L225 Difference]: With dead ends: 207 [2019-10-01 23:07:33,039 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 23:07:33,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:07:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 23:07:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 23:07:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 23:07:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2019-10-01 23:07:33,045 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 117 [2019-10-01 23:07:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:33,045 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2019-10-01 23:07:33,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:07:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2019-10-01 23:07:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-01 23:07:33,046 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:33,046 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:33,046 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash -941838432, now seen corresponding path program 35 times [2019-10-01 23:07:33,047 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:33,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:33,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:33,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-10-01 23:07:33,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:33,617 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:07:33,660 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:10:14,233 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 23:10:14,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:10:14,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:10:14,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:10:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-01 23:10:14,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:10:14,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 23:10:14,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:10:14,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:10:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:10:14,356 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 39 states. [2019-10-01 23:10:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:10:14,571 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2019-10-01 23:10:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:10:14,577 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2019-10-01 23:10:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:10:14,578 INFO L225 Difference]: With dead ends: 212 [2019-10-01 23:10:14,578 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 23:10:14,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:10:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 23:10:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-10-01 23:10:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-01 23:10:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-10-01 23:10:14,584 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 120 [2019-10-01 23:10:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:10:14,584 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-10-01 23:10:14,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:10:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-10-01 23:10:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 23:10:14,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:10:14,586 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:10:14,586 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:10:14,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:10:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1091551234, now seen corresponding path program 36 times [2019-10-01 23:10:14,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:10:14,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:10:14,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:14,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:10:14,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-10-01 23:10:15,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:10:15,187 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:10:15,233 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE