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/reducercommutativity/max40-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:09:42,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:09:42,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:09:42,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:09:42,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:09:42,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:09:42,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:09:42,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:09:42,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:09:42,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:09:42,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:09:42,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:09:42,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:09:42,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:09:42,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:09:42,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:09:42,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:09:42,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:09:42,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:09:42,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:09:42,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:09:42,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:09:42,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:09:42,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:09:42,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:09:42,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:09:42,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:09:42,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:09:42,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:09:42,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:09:42,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:09:42,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:09:42,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:09:42,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:09:42,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:09:42,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:09:42,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:09:42,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:09:42,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:09:42,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:09:42,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:09:42,666 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-09-07 11:09:42,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:09:42,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:09:42,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:09:42,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:09:42,689 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:09:42,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:09:42,689 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:09:42,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:09:42,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:09:42,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:09:42,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:09:42,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:09:42,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:09:42,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:09:42,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:09:42,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:09:42,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:09:42,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:09:42,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:09:42,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:09:42,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:09:42,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:09:42,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:09:42,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:09:42,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:09:42,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:09:42,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:09:42,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:09:42,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:09:42,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:09:42,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:09:42,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:09:42,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:09:42,758 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:09:42,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max40-1.i [2019-09-07 11:09:42,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11a470a9/c39c34dc0b9447aca7af9b5421941b3e/FLAGa945b8520 [2019-09-07 11:09:43,257 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:09:43,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max40-1.i [2019-09-07 11:09:43,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11a470a9/c39c34dc0b9447aca7af9b5421941b3e/FLAGa945b8520 [2019-09-07 11:09:43,629 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11a470a9/c39c34dc0b9447aca7af9b5421941b3e [2019-09-07 11:09:43,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:09:43,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:09:43,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:09:43,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:09:43,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:09:43,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:43,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa3d82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43, skipping insertion in model container [2019-09-07 11:09:43,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:43,656 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:09:43,675 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:09:43,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:09:43,875 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:09:43,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:09:43,917 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:09:43,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43 WrapperNode [2019-09-07 11:09:43,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:09:43,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:09:43,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:09:43,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:09:44,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:44,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:44,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:44,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:44,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:44,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:44,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (1/1) ... [2019-09-07 11:09:44,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:09:44,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:09:44,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:09:44,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:09:44,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (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-09-07 11:09:44,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:09:44,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:09:44,097 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-09-07 11:09:44,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:09:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:09:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:09:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-09-07 11:09:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:09:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:09:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:09:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:09:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:09:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:09:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:09:44,423 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:09:44,423 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:09:44,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:09:44 BoogieIcfgContainer [2019-09-07 11:09:44,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:09:44,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:09:44,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:09:44,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:09:44,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:09:43" (1/3) ... [2019-09-07 11:09:44,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b1579f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:09:44, skipping insertion in model container [2019-09-07 11:09:44,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:09:43" (2/3) ... [2019-09-07 11:09:44,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b1579f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:09:44, skipping insertion in model container [2019-09-07 11:09:44,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:09:44" (3/3) ... [2019-09-07 11:09:44,432 INFO L109 eAbstractionObserver]: Analyzing ICFG max40-1.i [2019-09-07 11:09:44,442 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:09:44,447 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:09:44,462 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:09:44,493 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:09:44,494 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:09:44,494 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:09:44,494 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:09:44,494 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:09:44,494 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:09:44,494 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:09:44,494 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:09:44,494 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:09:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-07 11:09:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:09:44,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:44,516 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:44,518 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1379671032, now seen corresponding path program 1 times [2019-09-07 11:09:44,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:44,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:44,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:09:44,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:09:44,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:09:44,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:09:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:09:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:09:44,719 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-09-07 11:09:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:44,772 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-09-07 11:09:44,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:09:44,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 11:09:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:44,783 INFO L225 Difference]: With dead ends: 60 [2019-09-07 11:09:44,783 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 11:09:44,787 INFO L628 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-09-07 11:09:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 11:09:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-07 11:09:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 11:09:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-09-07 11:09:44,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2019-09-07 11:09:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:44,830 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-09-07 11:09:44,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:09:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-09-07 11:09:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 11:09:44,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:44,833 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:44,834 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:44,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash 551744077, now seen corresponding path program 1 times [2019-09-07 11:09:44,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:44,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:44,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:44,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:44,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:09:44,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:44,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:44,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:44,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:09:44,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:09:45,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:09:45,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 11:09:45,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:09:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:09:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:09:45,041 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 4 states. [2019-09-07 11:09:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:45,069 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-09-07 11:09:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:09:45,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-07 11:09:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:45,071 INFO L225 Difference]: With dead ends: 52 [2019-09-07 11:09:45,072 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 11:09:45,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:09:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 11:09:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-09-07 11:09:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 11:09:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-09-07 11:09:45,081 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2019-09-07 11:09:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:45,081 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-09-07 11:09:45,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:09:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-09-07 11:09:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 11:09:45,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:45,084 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:45,084 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:45,085 INFO L82 PathProgramCache]: Analyzing trace with hash 727331048, now seen corresponding path program 1 times [2019-09-07 11:09:45,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:45,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:45,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:45,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:45,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:09:45,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:09:45,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:09:45,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:09:45,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:09:45,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:09:45,183 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 3 states. [2019-09-07 11:09:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:45,199 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-09-07 11:09:45,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:09:45,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-07 11:09:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:45,201 INFO L225 Difference]: With dead ends: 47 [2019-09-07 11:09:45,201 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 11:09:45,202 INFO L628 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-09-07 11:09:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 11:09:45,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-07 11:09:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 11:09:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-07 11:09:45,209 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 46 [2019-09-07 11:09:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:45,210 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-07 11:09:45,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:09:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-07 11:09:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 11:09:45,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:45,212 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:45,213 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash -270429754, now seen corresponding path program 1 times [2019-09-07 11:09:45,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:45,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:45,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:45,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:45,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:09:45,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:45,329 INFO L223 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) [2019-09-07 11:09:45,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:45,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:09:45,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:09:45,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:45,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 11:09:45,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:09:45,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:09:45,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:09:45,426 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-09-07 11:09:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:45,483 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-09-07 11:09:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:09:45,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-07 11:09:45,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:45,485 INFO L225 Difference]: With dead ends: 56 [2019-09-07 11:09:45,486 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 11:09:45,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-09-07 11:09:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 11:09:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-07 11:09:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 11:09:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-09-07 11:09:45,498 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 48 [2019-09-07 11:09:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:45,499 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-09-07 11:09:45,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:09:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-09-07 11:09:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:09:45,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:45,503 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:45,503 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1585951496, now seen corresponding path program 2 times [2019-09-07 11:09:45,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:45,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:45,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:45,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:45,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 11:09:45,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:45,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:45,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:09:45,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:09:45,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:45,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:09:45,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:09:45,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:45,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 11:09:45,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:09:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:09:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:09:45,717 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 7 states. [2019-09-07 11:09:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:45,780 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2019-09-07 11:09:45,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:09:45,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-09-07 11:09:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:45,782 INFO L225 Difference]: With dead ends: 65 [2019-09-07 11:09:45,782 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 11:09:45,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:09:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 11:09:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-07 11:09:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 11:09:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-09-07 11:09:45,798 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 50 [2019-09-07 11:09:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:45,798 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-09-07 11:09:45,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:09:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-09-07 11:09:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 11:09:45,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:45,800 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:45,800 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash 118381797, now seen corresponding path program 3 times [2019-09-07 11:09:45,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:45,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 11:09:45,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:45,911 INFO L223 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-09-07 11:09:45,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:45,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:09:45,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:45,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:09:45,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 11:09:46,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:46,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 11:09:46,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:09:46,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:09:46,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:09:46,020 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 6 states. [2019-09-07 11:09:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:46,060 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-09-07 11:09:46,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:09:46,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-07 11:09:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:46,063 INFO L225 Difference]: With dead ends: 71 [2019-09-07 11:09:46,063 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 11:09:46,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 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-09-07 11:09:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 11:09:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-07 11:09:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 11:09:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-09-07 11:09:46,082 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 64 [2019-09-07 11:09:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:46,082 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-09-07 11:09:46,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:09:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-09-07 11:09:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 11:09:46,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:46,087 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:46,088 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash 12656000, now seen corresponding path program 4 times [2019-09-07 11:09:46,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:46,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:46,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:46,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-07 11:09:46,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:46,219 INFO L223 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) [2019-09-07 11:09:46,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:46,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:09:46,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:46,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:09:46,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:09:46,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:46,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2019-09-07 11:09:46,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:09:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:09:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:09:46,364 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 8 states. [2019-09-07 11:09:46,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:46,428 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2019-09-07 11:09:46,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:09:46,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-09-07 11:09:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:46,429 INFO L225 Difference]: With dead ends: 79 [2019-09-07 11:09:46,430 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 11:09:46,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:09:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 11:09:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-07 11:09:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:09:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-09-07 11:09:46,444 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 76 [2019-09-07 11:09:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:46,446 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-09-07 11:09:46,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:09:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-09-07 11:09:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 11:09:46,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:46,448 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:46,449 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1935614368, now seen corresponding path program 5 times [2019-09-07 11:09:46,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:46,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:46,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:46,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:46,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-07 11:09:46,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:46,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:46,568 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:09:46,658 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 11:09:46,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:46,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:09:46,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 11:09:46,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:46,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:09:46,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:09:46,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:09:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:09:46,698 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 7 states. [2019-09-07 11:09:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:46,739 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2019-09-07 11:09:46,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:09:46,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-09-07 11:09:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:46,741 INFO L225 Difference]: With dead ends: 85 [2019-09-07 11:09:46,741 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 11:09:46,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 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-09-07 11:09:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 11:09:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-09-07 11:09:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 11:09:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-09-07 11:09:46,748 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 80 [2019-09-07 11:09:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:46,748 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-09-07 11:09:46,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:09:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-09-07 11:09:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 11:09:46,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:46,755 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:46,756 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1506101179, now seen corresponding path program 6 times [2019-09-07 11:09:46,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:46,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:46,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:46,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-09-07 11:09:46,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:46,835 INFO L223 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-09-07 11:09:46,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:46,967 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 11:09:46,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:46,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:09:46,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 154 proven. 4 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-09-07 11:09:47,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:47,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 11:09:47,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:09:47,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:09:47,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:09:47,011 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 6 states. [2019-09-07 11:09:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:47,057 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-09-07 11:09:47,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:09:47,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-09-07 11:09:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:47,061 INFO L225 Difference]: With dead ends: 81 [2019-09-07 11:09:47,061 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 11:09:47,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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-09-07 11:09:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 11:09:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-07 11:09:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 11:09:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-09-07 11:09:47,075 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 92 [2019-09-07 11:09:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:47,076 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-09-07 11:09:47,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:09:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-09-07 11:09:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 11:09:47,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:47,082 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:47,082 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1361671399, now seen corresponding path program 7 times [2019-09-07 11:09:47,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:47,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:47,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:47,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:47,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 11:09:47,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:47,209 INFO L223 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) [2019-09-07 11:09:47,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:47,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:09:47,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 11:09:47,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:47,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 11:09:47,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:09:47,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:09:47,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:09:47,345 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 8 states. [2019-09-07 11:09:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:47,379 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-09-07 11:09:47,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:09:47,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-09-07 11:09:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:47,381 INFO L225 Difference]: With dead ends: 94 [2019-09-07 11:09:47,382 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 11:09:47,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 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-09-07 11:09:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 11:09:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-07 11:09:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 11:09:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-09-07 11:09:47,399 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 94 [2019-09-07 11:09:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:47,399 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-09-07 11:09:47,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:09:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-09-07 11:09:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 11:09:47,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:47,402 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:47,402 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1936247003, now seen corresponding path program 8 times [2019-09-07 11:09:47,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:47,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:47,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:47,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 11:09:47,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:47,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:47,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:09:47,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:09:47,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:47,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:09:47,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 11:09:47,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:47,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 11:09:47,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:09:47,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:09:47,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:09:47,679 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 13 states. [2019-09-07 11:09:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:47,747 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2019-09-07 11:09:47,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:09:47,747 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-07 11:09:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:47,748 INFO L225 Difference]: With dead ends: 103 [2019-09-07 11:09:47,748 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 11:09:47,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:09:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 11:09:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-09-07 11:09:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 11:09:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-09-07 11:09:47,755 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 96 [2019-09-07 11:09:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:47,755 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-09-07 11:09:47,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:09:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-09-07 11:09:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 11:09:47,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:47,757 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:47,757 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash -767191368, now seen corresponding path program 9 times [2019-09-07 11:09:47,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:47,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:47,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:47,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-09-07 11:09:47,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:47,842 INFO L223 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-09-07 11:09:47,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:09:47,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 11:09:47,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:47,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:09:47,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 230 proven. 9 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 11:09:47,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:48,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:09:48,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:09:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:09:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:09:48,001 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 7 states. [2019-09-07 11:09:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:48,023 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2019-09-07 11:09:48,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:09:48,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2019-09-07 11:09:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:48,026 INFO L225 Difference]: With dead ends: 95 [2019-09-07 11:09:48,026 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 11:09:48,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 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-09-07 11:09:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 11:09:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-07 11:09:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 11:09:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-09-07 11:09:48,040 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 110 [2019-09-07 11:09:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:48,040 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-09-07 11:09:48,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:09:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-09-07 11:09:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 11:09:48,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:48,043 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:48,043 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1145695594, now seen corresponding path program 10 times [2019-09-07 11:09:48,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:48,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:48,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-07 11:09:48,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:48,140 INFO L223 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-09-07 11:09:48,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:09:48,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:09:48,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:48,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:09:48,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-07 11:09:48,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:48,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 11:09:48,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:09:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:09:48,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:09:48,346 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 15 states. [2019-09-07 11:09:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:48,431 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-09-07 11:09:48,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:09:48,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2019-09-07 11:09:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:48,432 INFO L225 Difference]: With dead ends: 117 [2019-09-07 11:09:48,432 INFO L226 Difference]: Without dead ends: 73 [2019-09-07 11:09:48,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:09:48,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-07 11:09:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-09-07 11:09:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-07 11:09:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-09-07 11:09:48,438 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 112 [2019-09-07 11:09:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:48,438 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-09-07 11:09:48,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:09:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2019-09-07 11:09:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 11:09:48,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:48,440 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 7, 7, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:48,440 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:48,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1108345331, now seen corresponding path program 11 times [2019-09-07 11:09:48,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:48,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:48,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:48,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:48,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-09-07 11:09:48,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:48,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:48,560 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:09:48,801 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-07 11:09:48,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:48,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:09:48,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 316 proven. 66 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-07 11:09:48,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:48,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-07 11:09:48,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:09:48,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:09:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:09:48,897 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 14 states. [2019-09-07 11:09:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:48,970 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-09-07 11:09:48,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:09:48,970 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 126 [2019-09-07 11:09:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:48,972 INFO L225 Difference]: With dead ends: 126 [2019-09-07 11:09:48,972 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 11:09:48,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:09:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 11:09:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-09-07 11:09:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 11:09:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-09-07 11:09:48,978 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 126 [2019-09-07 11:09:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:48,978 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-09-07 11:09:48,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:09:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-09-07 11:09:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 11:09:48,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:48,980 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 7, 7, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:48,980 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:48,980 INFO L82 PathProgramCache]: Analyzing trace with hash -193358484, now seen corresponding path program 12 times [2019-09-07 11:09:48,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:48,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:48,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:48,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:48,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-09-07 11:09:49,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:49,094 INFO L223 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) [2019-09-07 11:09:49,107 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:49,498 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 11:09:49,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:49,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:09:49,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 430 proven. 25 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-09-07 11:09:49,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:49,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 11:09:49,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:09:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:09:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:09:49,569 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 9 states. [2019-09-07 11:09:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:49,599 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2019-09-07 11:09:49,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:09:49,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2019-09-07 11:09:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:49,601 INFO L225 Difference]: With dead ends: 117 [2019-09-07 11:09:49,601 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 11:09:49,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 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-09-07 11:09:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 11:09:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-07 11:09:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 11:09:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-09-07 11:09:49,606 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 140 [2019-09-07 11:09:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:49,607 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-09-07 11:09:49,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:09:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-09-07 11:09:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 11:09:49,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:49,609 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 7, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:49,609 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:49,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:49,609 INFO L82 PathProgramCache]: Analyzing trace with hash 575380426, now seen corresponding path program 13 times [2019-09-07 11:09:49,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:49,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:49,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:49,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:49,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2019-09-07 11:09:49,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:49,736 INFO L223 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) [2019-09-07 11:09:49,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:49,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:09:49,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2019-09-07 11:09:49,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:49,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 11:09:49,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 11:09:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 11:09:49,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:09:49,872 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 11 states. [2019-09-07 11:09:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:49,907 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2019-09-07 11:09:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:09:49,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2019-09-07 11:09:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:49,909 INFO L225 Difference]: With dead ends: 136 [2019-09-07 11:09:49,909 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 11:09:49,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 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-09-07 11:09:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 11:09:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-07 11:09:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 11:09:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2019-09-07 11:09:49,917 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 142 [2019-09-07 11:09:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:49,917 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-09-07 11:09:49,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 11:09:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2019-09-07 11:09:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 11:09:49,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:49,920 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 8, 8, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:49,920 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash 718704012, now seen corresponding path program 14 times [2019-09-07 11:09:49,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:49,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:49,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:49,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:49,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-09-07 11:09:50,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:50,079 INFO L223 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-09-07 11:09:50,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:09:50,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:09:50,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:50,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:09:50,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2019-09-07 11:09:50,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:50,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 11:09:50,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:09:50,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:09:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:09:50,330 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 19 states. [2019-09-07 11:09:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:50,430 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2019-09-07 11:09:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:09:50,431 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2019-09-07 11:09:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:50,432 INFO L225 Difference]: With dead ends: 145 [2019-09-07 11:09:50,432 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 11:09:50,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:09:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 11:09:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-09-07 11:09:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 11:09:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-09-07 11:09:50,438 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 144 [2019-09-07 11:09:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:50,438 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-09-07 11:09:50,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:09:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-09-07 11:09:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 11:09:50,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:50,442 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:50,442 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash 369000425, now seen corresponding path program 15 times [2019-09-07 11:09:50,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:50,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:50,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1308 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2019-09-07 11:09:50,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:50,566 INFO L223 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:09:50,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:09:50,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:50,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:09:50,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1308 backedges. 554 proven. 36 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked. [2019-09-07 11:09:50,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:50,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 11:09:50,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:09:50,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:09:50,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:09:50,819 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 10 states. [2019-09-07 11:09:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:50,854 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2019-09-07 11:09:50,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:09:50,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2019-09-07 11:09:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:50,856 INFO L225 Difference]: With dead ends: 131 [2019-09-07 11:09:50,856 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 11:09:50,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 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-09-07 11:09:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 11:09:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-07 11:09:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 11:09:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-09-07 11:09:50,862 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 158 [2019-09-07 11:09:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:50,862 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-09-07 11:09:50,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:09:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-09-07 11:09:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-07 11:09:50,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:50,864 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 9, 9, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:50,865 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash -95469881, now seen corresponding path program 16 times [2019-09-07 11:09:50,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:50,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:50,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:50,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:50,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-09-07 11:09:51,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:51,034 INFO L223 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) [2019-09-07 11:09:51,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:51,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:09:51,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:51,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:09:51,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2019-09-07 11:09:51,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:51,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 11:09:51,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:09:51,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:09:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:09:51,356 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 21 states. [2019-09-07 11:09:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:51,449 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2019-09-07 11:09:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:09:51,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 160 [2019-09-07 11:09:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:51,451 INFO L225 Difference]: With dead ends: 159 [2019-09-07 11:09:51,451 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 11:09:51,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:09:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 11:09:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-09-07 11:09:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-07 11:09:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-09-07 11:09:51,456 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 160 [2019-09-07 11:09:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:51,456 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-09-07 11:09:51,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:09:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-09-07 11:09:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 11:09:51,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:51,459 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:51,459 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:51,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:51,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1192750428, now seen corresponding path program 17 times [2019-09-07 11:09:51,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:51,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:51,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:51,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:51,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-07 11:09:51,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:51,581 INFO L223 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-09-07 11:09:51,591 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:09:52,256 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 11:09:52,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:52,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:09:52,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 688 proven. 153 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-09-07 11:09:52,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:52,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 11:09:52,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:09:52,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:09:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:09:52,431 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 20 states. [2019-09-07 11:09:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:52,519 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2019-09-07 11:09:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:09:52,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 174 [2019-09-07 11:09:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:52,521 INFO L225 Difference]: With dead ends: 168 [2019-09-07 11:09:52,521 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 11:09:52,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:09:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 11:09:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-09-07 11:09:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-07 11:09:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2019-09-07 11:09:52,527 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 174 [2019-09-07 11:09:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:52,527 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2019-09-07 11:09:52,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:09:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2019-09-07 11:09:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 11:09:52,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:52,530 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:52,530 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1362319773, now seen corresponding path program 18 times [2019-09-07 11:09:52,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:52,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:52,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:52,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:52,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2019-09-07 11:09:52,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:52,709 INFO L223 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) [2019-09-07 11:09:52,723 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:53,375 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-09-07 11:09:53,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:53,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 11:09:53,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:53,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:09:53,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:09:53,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:09:53,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:09:53,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-07 11:09:53,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:09:53,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:09:53,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2019-09-07 11:09:53,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:09:53,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:09:53,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:09:53,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:19 [2019-09-07 11:09:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 1167 proven. 235 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-09-07 11:09:54,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:54,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 28 [2019-09-07 11:09:54,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:09:54,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:09:54,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:09:54,254 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 28 states. [2019-09-07 11:09:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:55,074 INFO L93 Difference]: Finished difference Result 312 states and 370 transitions. [2019-09-07 11:09:55,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:09:55,075 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 188 [2019-09-07 11:09:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:55,076 INFO L225 Difference]: With dead ends: 312 [2019-09-07 11:09:55,077 INFO L226 Difference]: Without dead ends: 205 [2019-09-07 11:09:55,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=294, Invalid=1512, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:09:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-07 11:09:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2019-09-07 11:09:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-07 11:09:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2019-09-07 11:09:55,088 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 188 [2019-09-07 11:09:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:55,088 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2019-09-07 11:09:55,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:09:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2019-09-07 11:09:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 11:09:55,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:55,091 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:55,091 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash 257169405, now seen corresponding path program 1 times [2019-09-07 11:09:55,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:55,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:55,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:55,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:55,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2019-09-07 11:09:55,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:55,275 INFO L223 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) [2019-09-07 11:09:55,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:55,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:09:55,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2019-09-07 11:09:55,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:55,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 11:09:55,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:09:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:09:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:09:55,436 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand 14 states. [2019-09-07 11:09:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:55,490 INFO L93 Difference]: Finished difference Result 364 states and 438 transitions. [2019-09-07 11:09:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:09:55,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 190 [2019-09-07 11:09:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:55,495 INFO L225 Difference]: With dead ends: 364 [2019-09-07 11:09:55,495 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 11:09:55,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 190 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-09-07 11:09:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 11:09:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-07 11:09:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-07 11:09:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2019-09-07 11:09:55,512 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 190 [2019-09-07 11:09:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:55,513 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2019-09-07 11:09:55,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:09:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2019-09-07 11:09:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 11:09:55,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:55,515 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 11, 11, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:55,515 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:55,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1277148607, now seen corresponding path program 2 times [2019-09-07 11:09:55,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:55,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:55,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:55,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:09:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2047 backedges. 0 proven. 1038 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2019-09-07 11:09:55,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:55,677 INFO L223 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-09-07 11:09:55,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:09:55,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:09:55,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:55,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:09:55,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2047 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2019-09-07 11:09:56,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:56,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 11:09:56,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:09:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:09:56,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:09:56,149 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 25 states. [2019-09-07 11:09:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:56,245 INFO L93 Difference]: Finished difference Result 387 states and 477 transitions. [2019-09-07 11:09:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:09:56,246 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 192 [2019-09-07 11:09:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:56,247 INFO L225 Difference]: With dead ends: 387 [2019-09-07 11:09:56,247 INFO L226 Difference]: Without dead ends: 220 [2019-09-07 11:09:56,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:09:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-07 11:09:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2019-09-07 11:09:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-07 11:09:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2019-09-07 11:09:56,259 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 192 [2019-09-07 11:09:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:56,259 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2019-09-07 11:09:56,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:09:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2019-09-07 11:09:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-07 11:09:56,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:56,261 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 12, 12, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:56,262 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash 440529564, now seen corresponding path program 3 times [2019-09-07 11:09:56,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:56,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:56,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:56,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:56,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 2370 trivial. 0 not checked. [2019-09-07 11:09:56,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:56,446 INFO L223 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) [2019-09-07 11:09:56,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:09:57,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 11:09:57,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:57,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:09:57,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 1022 proven. 81 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2019-09-07 11:09:57,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:57,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 11:09:57,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:09:57,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:09:57,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:09:57,291 INFO L87 Difference]: Start difference. First operand 210 states and 250 transitions. Second operand 13 states. [2019-09-07 11:09:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:57,337 INFO L93 Difference]: Finished difference Result 314 states and 377 transitions. [2019-09-07 11:09:57,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:09:57,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 206 [2019-09-07 11:09:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:57,342 INFO L225 Difference]: With dead ends: 314 [2019-09-07 11:09:57,342 INFO L226 Difference]: Without dead ends: 213 [2019-09-07 11:09:57,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 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-09-07 11:09:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-07 11:09:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-07 11:09:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 11:09:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2019-09-07 11:09:57,354 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 206 [2019-09-07 11:09:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:57,354 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2019-09-07 11:09:57,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:09:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2019-09-07 11:09:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-07 11:09:57,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:57,358 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 12, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:57,358 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash 6274042, now seen corresponding path program 4 times [2019-09-07 11:09:57,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:57,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:57,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:57,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:57,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 1251 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2019-09-07 11:09:57,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:57,591 INFO L223 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-09-07 11:09:57,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:09:57,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:09:57,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:57,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:09:57,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-09-07 11:09:57,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:57,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-09-07 11:09:57,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 11:09:57,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 11:09:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:09:57,906 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 27 states. [2019-09-07 11:09:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:58,041 INFO L93 Difference]: Finished difference Result 417 states and 513 transitions. [2019-09-07 11:09:58,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:09:58,042 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 208 [2019-09-07 11:09:58,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:58,043 INFO L225 Difference]: With dead ends: 417 [2019-09-07 11:09:58,044 INFO L226 Difference]: Without dead ends: 236 [2019-09-07 11:09:58,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:09:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-07 11:09:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2019-09-07 11:09:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-07 11:09:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 269 transitions. [2019-09-07 11:09:58,056 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 269 transitions. Word has length 208 [2019-09-07 11:09:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:58,056 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 269 transitions. [2019-09-07 11:09:58,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 11:09:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 269 transitions. [2019-09-07 11:09:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 11:09:58,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:58,059 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 13, 13, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:09:58,059 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:58,059 INFO L82 PathProgramCache]: Analyzing trace with hash 79237719, now seen corresponding path program 5 times [2019-09-07 11:09:58,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:58,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:58,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:58,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:58,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2912 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-07 11:09:58,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:58,246 INFO L223 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) [2019-09-07 11:09:58,266 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:00,865 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-07 11:10:00,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:00,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:10:00,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2912 backedges. 1204 proven. 276 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2019-09-07 11:10:01,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:01,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-09-07 11:10:01,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:10:01,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:10:01,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:10:01,102 INFO L87 Difference]: Start difference. First operand 226 states and 269 transitions. Second operand 26 states. [2019-09-07 11:10:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:01,202 INFO L93 Difference]: Finished difference Result 442 states and 542 transitions. [2019-09-07 11:10:01,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:10:01,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 222 [2019-09-07 11:10:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:01,205 INFO L225 Difference]: With dead ends: 442 [2019-09-07 11:10:01,205 INFO L226 Difference]: Without dead ends: 250 [2019-09-07 11:10:01,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:10:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-07 11:10:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2019-09-07 11:10:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-07 11:10:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 286 transitions. [2019-09-07 11:10:01,218 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 286 transitions. Word has length 222 [2019-09-07 11:10:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:01,218 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 286 transitions. [2019-09-07 11:10:01,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:10:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 286 transitions. [2019-09-07 11:10:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 11:10:01,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:01,221 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 13, 13, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:01,221 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:01,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:01,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1624534448, now seen corresponding path program 6 times [2019-09-07 11:10:01,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:01,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:01,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:01,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:01,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3265 trivial. 0 not checked. [2019-09-07 11:10:01,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:01,421 INFO L223 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) [2019-09-07 11:10:01,436 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:03,229 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 11:10:03,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:03,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:10:03,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 1414 proven. 121 refuted. 0 times theorem prover too weak. 1851 trivial. 0 not checked. [2019-09-07 11:10:03,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:03,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 11:10:03,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:10:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:10:03,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:10:03,282 INFO L87 Difference]: Start difference. First operand 240 states and 286 transitions. Second operand 15 states. [2019-09-07 11:10:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:03,347 INFO L93 Difference]: Finished difference Result 360 states and 433 transitions. [2019-09-07 11:10:03,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:10:03,350 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 236 [2019-09-07 11:10:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:03,352 INFO L225 Difference]: With dead ends: 360 [2019-09-07 11:10:03,352 INFO L226 Difference]: Without dead ends: 243 [2019-09-07 11:10:03,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:10:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-07 11:10:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-09-07 11:10:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 11:10:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 288 transitions. [2019-09-07 11:10:03,364 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 288 transitions. Word has length 236 [2019-09-07 11:10:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:03,365 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 288 transitions. [2019-09-07 11:10:03,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:10:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 288 transitions. [2019-09-07 11:10:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-07 11:10:03,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:03,367 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 13, 13, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:03,368 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash 669525550, now seen corresponding path program 7 times [2019-09-07 11:10:03,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:03,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3409 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-07 11:10:03,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:03,636 INFO L223 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) [2019-09-07 11:10:03,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:03,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:10:03,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3409 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-07 11:10:03,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:03,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 11:10:03,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 11:10:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 11:10:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:10:03,820 INFO L87 Difference]: Start difference. First operand 242 states and 288 transitions. Second operand 17 states. [2019-09-07 11:10:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:03,874 INFO L93 Difference]: Finished difference Result 454 states and 546 transitions. [2019-09-07 11:10:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:10:03,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 238 [2019-09-07 11:10:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:03,876 INFO L225 Difference]: With dead ends: 454 [2019-09-07 11:10:03,877 INFO L226 Difference]: Without dead ends: 245 [2019-09-07 11:10:03,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 238 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-09-07 11:10:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-07 11:10:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-09-07 11:10:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-07 11:10:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 290 transitions. [2019-09-07 11:10:03,887 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 290 transitions. Word has length 238 [2019-09-07 11:10:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:03,888 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 290 transitions. [2019-09-07 11:10:03,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 11:10:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 290 transitions. [2019-09-07 11:10:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 11:10:03,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:03,890 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 14, 14, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:03,890 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -650346512, now seen corresponding path program 8 times [2019-09-07 11:10:03,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:03,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:03,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3436 backedges. 0 proven. 1737 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [2019-09-07 11:10:04,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:04,111 INFO L223 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-09-07 11:10:04,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:10:04,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:04,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:04,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:10:04,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3436 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-07 11:10:04,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:04,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 11:10:04,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:10:04,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:10:04,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:10:04,531 INFO L87 Difference]: Start difference. First operand 244 states and 290 transitions. Second operand 31 states. [2019-09-07 11:10:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:04,687 INFO L93 Difference]: Finished difference Result 477 states and 585 transitions. [2019-09-07 11:10:04,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:10:04,687 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 240 [2019-09-07 11:10:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:04,689 INFO L225 Difference]: With dead ends: 477 [2019-09-07 11:10:04,689 INFO L226 Difference]: Without dead ends: 268 [2019-09-07 11:10:04,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:10:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-07 11:10:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2019-09-07 11:10:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-07 11:10:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2019-09-07 11:10:04,701 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 240 [2019-09-07 11:10:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:04,701 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2019-09-07 11:10:04,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:10:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2019-09-07 11:10:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-07 11:10:04,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:04,704 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 15, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:04,704 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1147676339, now seen corresponding path program 9 times [2019-09-07 11:10:04,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:04,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:04,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3954 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 3810 trivial. 0 not checked. [2019-09-07 11:10:04,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:04,899 INFO L223 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-09-07 11:10:04,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:10:06,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 11:10:06,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:06,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:10:06,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3954 backedges. 1634 proven. 144 refuted. 0 times theorem prover too weak. 2176 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:06,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:06,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 11:10:06,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:10:06,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:10:06,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:10:06,574 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand 16 states. [2019-09-07 11:10:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:06,616 INFO L93 Difference]: Finished difference Result 386 states and 464 transitions. [2019-09-07 11:10:06,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:10:06,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 254 [2019-09-07 11:10:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:06,618 INFO L225 Difference]: With dead ends: 386 [2019-09-07 11:10:06,618 INFO L226 Difference]: Without dead ends: 261 [2019-09-07 11:10:06,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:10:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-07 11:10:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2019-09-07 11:10:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-07 11:10:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 309 transitions. [2019-09-07 11:10:06,630 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 309 transitions. Word has length 254 [2019-09-07 11:10:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:06,630 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 309 transitions. [2019-09-07 11:10:06,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:10:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 309 transitions. [2019-09-07 11:10:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-07 11:10:06,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:06,633 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 15, 15, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:06,633 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash 862897579, now seen corresponding path program 10 times [2019-09-07 11:10:06,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:06,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:06,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 2010 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2019-09-07 11:10:06,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:06,904 INFO L223 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-09-07 11:10:06,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:10:07,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:10:07,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:07,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:10:07,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 3754 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:07,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:07,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 11:10:07,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:10:07,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:10:07,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:10:07,323 INFO L87 Difference]: Start difference. First operand 260 states and 309 transitions. Second operand 33 states. [2019-09-07 11:10:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:07,468 INFO L93 Difference]: Finished difference Result 507 states and 621 transitions. [2019-09-07 11:10:07,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 11:10:07,472 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 256 [2019-09-07 11:10:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:07,474 INFO L225 Difference]: With dead ends: 507 [2019-09-07 11:10:07,474 INFO L226 Difference]: Without dead ends: 284 [2019-09-07 11:10:07,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:10:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-07 11:10:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2019-09-07 11:10:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-07 11:10:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 326 transitions. [2019-09-07 11:10:07,487 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 326 transitions. Word has length 256 [2019-09-07 11:10:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:07,487 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 326 transitions. [2019-09-07 11:10:07,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:10:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 326 transitions. [2019-09-07 11:10:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-07 11:10:07,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:07,492 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 16, 16, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:07,492 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:07,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:07,492 INFO L82 PathProgramCache]: Analyzing trace with hash -474677112, now seen corresponding path program 11 times [2019-09-07 11:10:07,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:07,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4535 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 4366 trivial. 0 not checked. [2019-09-07 11:10:07,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:07,742 INFO L223 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) [2019-09-07 11:10:07,755 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:18,148 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-07 11:10:18,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:18,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:10:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4535 backedges. 1864 proven. 435 refuted. 0 times theorem prover too weak. 2236 trivial. 0 not checked. [2019-09-07 11:10:18,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:18,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-09-07 11:10:18,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:10:18,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:10:18,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:10:18,532 INFO L87 Difference]: Start difference. First operand 274 states and 326 transitions. Second operand 32 states. [2019-09-07 11:10:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:18,713 INFO L93 Difference]: Finished difference Result 532 states and 650 transitions. [2019-09-07 11:10:18,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:10:18,713 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 270 [2019-09-07 11:10:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:18,715 INFO L225 Difference]: With dead ends: 532 [2019-09-07 11:10:18,715 INFO L226 Difference]: Without dead ends: 298 [2019-09-07 11:10:18,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:10:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-07 11:10:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 288. [2019-09-07 11:10:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-07 11:10:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 343 transitions. [2019-09-07 11:10:18,727 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 343 transitions. Word has length 270 [2019-09-07 11:10:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:18,727 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 343 transitions. [2019-09-07 11:10:18,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:10:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 343 transitions. [2019-09-07 11:10:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-07 11:10:18,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:18,730 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 16, 16, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:18,731 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash 476582913, now seen corresponding path program 12 times [2019-09-07 11:10:18,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:18,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:18,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 4927 trivial. 0 not checked. [2019-09-07 11:10:19,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:19,009 INFO L223 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) [2019-09-07 11:10:19,022 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:21,505 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 11:10:21,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:21,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:10:21,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 2122 proven. 196 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:21,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:21,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 11:10:21,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 11:10:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 11:10:21,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:10:21,626 INFO L87 Difference]: Start difference. First operand 288 states and 343 transitions. Second operand 18 states. [2019-09-07 11:10:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:21,684 INFO L93 Difference]: Finished difference Result 432 states and 520 transitions. [2019-09-07 11:10:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 11:10:21,684 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 284 [2019-09-07 11:10:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:21,687 INFO L225 Difference]: With dead ends: 432 [2019-09-07 11:10:21,687 INFO L226 Difference]: Without dead ends: 291 [2019-09-07 11:10:21,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 284 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-09-07 11:10:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-07 11:10:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2019-09-07 11:10:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-07 11:10:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 345 transitions. [2019-09-07 11:10:21,703 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 345 transitions. Word has length 284 [2019-09-07 11:10:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:21,704 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 345 transitions. [2019-09-07 11:10:21,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 11:10:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 345 transitions. [2019-09-07 11:10:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-07 11:10:21,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:21,707 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 16, 16, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:21,707 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1048327457, now seen corresponding path program 13 times [2019-09-07 11:10:21,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:21,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2019-09-07 11:10:22,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:22,073 INFO L223 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-09-07 11:10:22,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:22,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:10:22,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2019-09-07 11:10:22,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:22,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 11:10:22,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:10:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:10:22,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:10:22,357 INFO L87 Difference]: Start difference. First operand 290 states and 345 transitions. Second operand 20 states. [2019-09-07 11:10:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:22,433 INFO L93 Difference]: Finished difference Result 544 states and 654 transitions. [2019-09-07 11:10:22,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:10:22,433 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 286 [2019-09-07 11:10:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:22,435 INFO L225 Difference]: With dead ends: 544 [2019-09-07 11:10:22,435 INFO L226 Difference]: Without dead ends: 293 [2019-09-07 11:10:22,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:10:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-07 11:10:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-09-07 11:10:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-07 11:10:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 347 transitions. [2019-09-07 11:10:22,448 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 347 transitions. Word has length 286 [2019-09-07 11:10:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:22,448 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 347 transitions. [2019-09-07 11:10:22,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:10:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 347 transitions. [2019-09-07 11:10:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-07 11:10:22,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:22,452 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 17, 17, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:22,452 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2007554209, now seen corresponding path program 14 times [2019-09-07 11:10:22,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:22,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5185 backedges. 0 proven. 2616 refuted. 0 times theorem prover too weak. 2569 trivial. 0 not checked. [2019-09-07 11:10:22,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:22,781 INFO L223 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) [2019-09-07 11:10:22,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:22,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:22,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:22,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 11:10:22,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5185 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2019-09-07 11:10:23,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:23,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-09-07 11:10:23,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 11:10:23,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 11:10:23,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:10:23,375 INFO L87 Difference]: Start difference. First operand 292 states and 347 transitions. Second operand 37 states. [2019-09-07 11:10:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:23,544 INFO L93 Difference]: Finished difference Result 567 states and 693 transitions. [2019-09-07 11:10:23,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 11:10:23,544 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 288 [2019-09-07 11:10:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:23,546 INFO L225 Difference]: With dead ends: 567 [2019-09-07 11:10:23,546 INFO L226 Difference]: Without dead ends: 316 [2019-09-07 11:10:23,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:10:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-07 11:10:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 306. [2019-09-07 11:10:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-07 11:10:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2019-09-07 11:10:23,559 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 288 [2019-09-07 11:10:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:23,559 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2019-09-07 11:10:23,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 11:10:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2019-09-07 11:10:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-07 11:10:23,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:23,562 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 18, 18, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:23,563 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:23,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1192716674, now seen corresponding path program 15 times [2019-09-07 11:10:23,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:23,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:23,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:23,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:23,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5817 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 5592 trivial. 0 not checked. [2019-09-07 11:10:23,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:23,842 INFO L223 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) [2019-09-07 11:10:23,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:28,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 11:10:28,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:28,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:10:28,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5817 backedges. 2390 proven. 225 refuted. 0 times theorem prover too weak. 3202 trivial. 0 not checked. [2019-09-07 11:10:28,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:28,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 11:10:28,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:10:28,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:10:28,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:10:28,561 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand 19 states. [2019-09-07 11:10:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:28,623 INFO L93 Difference]: Finished difference Result 458 states and 551 transitions. [2019-09-07 11:10:28,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:10:28,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 302 [2019-09-07 11:10:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:28,626 INFO L225 Difference]: With dead ends: 458 [2019-09-07 11:10:28,626 INFO L226 Difference]: Without dead ends: 309 [2019-09-07 11:10:28,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 302 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-09-07 11:10:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-07 11:10:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2019-09-07 11:10:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-07 11:10:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 366 transitions. [2019-09-07 11:10:28,639 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 366 transitions. Word has length 302 [2019-09-07 11:10:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:28,640 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 366 transitions. [2019-09-07 11:10:28,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:10:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 366 transitions. [2019-09-07 11:10:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-07 11:10:28,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:28,643 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 18, 18, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:28,643 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:28,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1294345692, now seen corresponding path program 16 times [2019-09-07 11:10:28,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:28,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:28,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:28,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 0 proven. 2949 refuted. 0 times theorem prover too weak. 2899 trivial. 0 not checked. [2019-09-07 11:10:29,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:29,031 INFO L223 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-09-07 11:10:29,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:10:29,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:10:29,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:29,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:10:29,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5524 trivial. 0 not checked. [2019-09-07 11:10:29,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:29,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 11:10:29,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 11:10:29,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 11:10:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:10:29,569 INFO L87 Difference]: Start difference. First operand 308 states and 366 transitions. Second operand 39 states. [2019-09-07 11:10:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:29,728 INFO L93 Difference]: Finished difference Result 597 states and 729 transitions. [2019-09-07 11:10:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 11:10:29,728 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 304 [2019-09-07 11:10:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:29,730 INFO L225 Difference]: With dead ends: 597 [2019-09-07 11:10:29,731 INFO L226 Difference]: Without dead ends: 332 [2019-09-07 11:10:29,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:10:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-07 11:10:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 322. [2019-09-07 11:10:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-07 11:10:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 383 transitions. [2019-09-07 11:10:29,744 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 383 transitions. Word has length 304 [2019-09-07 11:10:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:29,745 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 383 transitions. [2019-09-07 11:10:29,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 11:10:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 383 transitions. [2019-09-07 11:10:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-07 11:10:29,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:29,748 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 19, 19, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:29,749 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1469351225, now seen corresponding path program 17 times [2019-09-07 11:10:29,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:29,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:29,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6518 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 6262 trivial. 0 not checked. [2019-09-07 11:10:30,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:30,113 INFO L223 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) [2019-09-07 11:10:30,132 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:50,744 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-07 11:10:50,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:50,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:10:50,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6518 backedges. 2668 proven. 630 refuted. 0 times theorem prover too weak. 3220 trivial. 0 not checked. [2019-09-07 11:10:51,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:51,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2019-09-07 11:10:51,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 11:10:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 11:10:51,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:10:51,168 INFO L87 Difference]: Start difference. First operand 322 states and 383 transitions. Second operand 38 states. [2019-09-07 11:10:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:51,350 INFO L93 Difference]: Finished difference Result 622 states and 758 transitions. [2019-09-07 11:10:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 11:10:51,351 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 318 [2019-09-07 11:10:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:51,353 INFO L225 Difference]: With dead ends: 622 [2019-09-07 11:10:51,354 INFO L226 Difference]: Without dead ends: 346 [2019-09-07 11:10:51,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:10:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-07 11:10:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 336. [2019-09-07 11:10:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-07 11:10:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 400 transitions. [2019-09-07 11:10:51,371 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 400 transitions. Word has length 318 [2019-09-07 11:10:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:51,372 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 400 transitions. [2019-09-07 11:10:51,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 11:10:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 400 transitions. [2019-09-07 11:10:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-07 11:10:51,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:51,375 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 19, 19, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:51,375 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:51,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1207495730, now seen corresponding path program 18 times [2019-09-07 11:10:51,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:51,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:51,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:51,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:51,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 6931 trivial. 0 not checked. [2019-09-07 11:10:51,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:51,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:51,703 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:10:57,808 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 11:10:57,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:57,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:10:57,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 2974 proven. 289 refuted. 0 times theorem prover too weak. 3957 trivial. 0 not checked. [2019-09-07 11:10:57,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:57,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 11:10:57,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:10:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:10:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:10:57,901 INFO L87 Difference]: Start difference. First operand 336 states and 400 transitions. Second operand 21 states. [2019-09-07 11:10:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:57,970 INFO L93 Difference]: Finished difference Result 504 states and 607 transitions. [2019-09-07 11:10:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:10:57,973 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 332 [2019-09-07 11:10:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:57,975 INFO L225 Difference]: With dead ends: 504 [2019-09-07 11:10:57,976 INFO L226 Difference]: Without dead ends: 339 [2019-09-07 11:10:57,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:10:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-07 11:10:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2019-09-07 11:10:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-07 11:10:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 402 transitions. [2019-09-07 11:10:57,987 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 402 transitions. Word has length 332 [2019-09-07 11:10:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:57,988 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 402 transitions. [2019-09-07 11:10:57,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:10:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 402 transitions. [2019-09-07 11:10:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-07 11:10:57,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:57,991 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 19, 19, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:57,991 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:57,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -660519408, now seen corresponding path program 19 times [2019-09-07 11:10:57,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:57,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:57,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7255 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 6894 trivial. 0 not checked. [2019-09-07 11:10:58,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:58,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:58,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:58,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:10:58,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7255 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 6894 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:58,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:58,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 11:10:58,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:10:58,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:10:58,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:10:58,594 INFO L87 Difference]: Start difference. First operand 338 states and 402 transitions. Second operand 23 states. [2019-09-07 11:10:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:58,648 INFO L93 Difference]: Finished difference Result 634 states and 762 transitions. [2019-09-07 11:10:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:10:58,649 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 334 [2019-09-07 11:10:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:58,651 INFO L225 Difference]: With dead ends: 634 [2019-09-07 11:10:58,652 INFO L226 Difference]: Without dead ends: 341 [2019-09-07 11:10:58,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:10:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-07 11:10:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2019-09-07 11:10:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-07 11:10:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 404 transitions. [2019-09-07 11:10:58,667 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 404 transitions. Word has length 334 [2019-09-07 11:10:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:58,668 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 404 transitions. [2019-09-07 11:10:58,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:10:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 404 transitions. [2019-09-07 11:10:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-07 11:10:58,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:58,671 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:58,671 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1943996370, now seen corresponding path program 20 times [2019-09-07 11:10:58,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:58,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:58,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:58,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7294 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 3619 trivial. 0 not checked. [2019-09-07 11:10:59,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:59,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:10:59,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:59,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:59,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:10:59,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7294 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 6894 trivial. 0 not checked. [2019-09-07 11:10:59,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:59,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 11:10:59,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 11:10:59,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 11:10:59,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:10:59,572 INFO L87 Difference]: Start difference. First operand 340 states and 404 transitions. Second operand 43 states. [2019-09-07 11:10:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:59,805 INFO L93 Difference]: Finished difference Result 657 states and 801 transitions. [2019-09-07 11:10:59,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 11:10:59,806 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 336 [2019-09-07 11:10:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:59,808 INFO L225 Difference]: With dead ends: 657 [2019-09-07 11:10:59,809 INFO L226 Difference]: Without dead ends: 364 [2019-09-07 11:10:59,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:10:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-07 11:10:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2019-09-07 11:10:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-07 11:10:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 421 transitions. [2019-09-07 11:10:59,830 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 421 transitions. Word has length 336 [2019-09-07 11:10:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:59,831 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 421 transitions. [2019-09-07 11:10:59,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 11:10:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 421 transitions. [2019-09-07 11:10:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-07 11:10:59,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:59,835 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 21, 21, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:59,836 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:59,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:59,836 INFO L82 PathProgramCache]: Analyzing trace with hash -111252945, now seen corresponding path program 21 times [2019-09-07 11:10:59,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:59,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:59,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 7716 trivial. 0 not checked. [2019-09-07 11:11:00,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:00,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:00,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:11:07,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-07 11:11:07,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:07,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:11:07,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 3290 proven. 324 refuted. 0 times theorem prover too weak. 4426 trivial. 0 not checked. [2019-09-07 11:11:07,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:07,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 11:11:07,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:11:07,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:11:07,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:11:07,903 INFO L87 Difference]: Start difference. First operand 354 states and 421 transitions. Second operand 22 states. [2019-09-07 11:11:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:07,960 INFO L93 Difference]: Finished difference Result 530 states and 638 transitions. [2019-09-07 11:11:07,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:11:07,961 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 350 [2019-09-07 11:11:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:07,963 INFO L225 Difference]: With dead ends: 530 [2019-09-07 11:11:07,963 INFO L226 Difference]: Without dead ends: 357 [2019-09-07 11:11:07,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:11:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-07 11:11:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2019-09-07 11:11:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-07 11:11:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 423 transitions. [2019-09-07 11:11:07,975 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 423 transitions. Word has length 350 [2019-09-07 11:11:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:07,975 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 423 transitions. [2019-09-07 11:11:07,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:11:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 423 transitions. [2019-09-07 11:11:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-07 11:11:07,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:07,979 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 21, 21, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:07,980 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:07,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1368384371, now seen corresponding path program 22 times [2019-09-07 11:11:07,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:07,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:07,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:07,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:07,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8077 backedges. 0 proven. 4068 refuted. 0 times theorem prover too weak. 4009 trivial. 0 not checked. [2019-09-07 11:11:08,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:08,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:08,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:11:08,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:11:08,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:08,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:11:08,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8077 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7636 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:11:09,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:09,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-09-07 11:11:09,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 11:11:09,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 11:11:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 11:11:09,047 INFO L87 Difference]: Start difference. First operand 356 states and 423 transitions. Second operand 45 states. [2019-09-07 11:11:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:09,248 INFO L93 Difference]: Finished difference Result 687 states and 837 transitions. [2019-09-07 11:11:09,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 11:11:09,252 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 352 [2019-09-07 11:11:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:09,255 INFO L225 Difference]: With dead ends: 687 [2019-09-07 11:11:09,255 INFO L226 Difference]: Without dead ends: 380 [2019-09-07 11:11:09,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 11:11:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-07 11:11:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 370. [2019-09-07 11:11:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-07 11:11:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 440 transitions. [2019-09-07 11:11:09,268 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 440 transitions. Word has length 352 [2019-09-07 11:11:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:09,268 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 440 transitions. [2019-09-07 11:11:09,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 11:11:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 440 transitions. [2019-09-07 11:11:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-07 11:11:09,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:09,272 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 22, 22, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:09,272 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash -873340822, now seen corresponding path program 23 times [2019-09-07 11:11:09,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:09,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:09,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:09,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:09,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8861 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 8500 trivial. 0 not checked. [2019-09-07 11:11:09,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:09,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:11:09,711 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:52,792 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-07 11:11:52,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:52,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:11:52,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8861 backedges. 3616 proven. 861 refuted. 0 times theorem prover too weak. 4384 trivial. 0 not checked. [2019-09-07 11:11:53,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:53,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-09-07 11:11:53,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 11:11:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 11:11:53,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:11:53,257 INFO L87 Difference]: Start difference. First operand 370 states and 440 transitions. Second operand 44 states. [2019-09-07 11:11:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:53,442 INFO L93 Difference]: Finished difference Result 712 states and 866 transitions. [2019-09-07 11:11:53,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 11:11:53,442 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 366 [2019-09-07 11:11:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:53,445 INFO L225 Difference]: With dead ends: 712 [2019-09-07 11:11:53,445 INFO L226 Difference]: Without dead ends: 394 [2019-09-07 11:11:53,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:11:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-07 11:11:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 384. [2019-09-07 11:11:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-07 11:11:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 457 transitions. [2019-09-07 11:11:53,457 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 457 transitions. Word has length 366 [2019-09-07 11:11:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:53,458 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 457 transitions. [2019-09-07 11:11:53,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 11:11:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 457 transitions. [2019-09-07 11:11:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-07 11:11:53,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:53,461 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 22, 22, 20, 20, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:53,461 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:53,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1377281309, now seen corresponding path program 24 times [2019-09-07 11:11:53,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:53,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:53,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:53,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:53,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9677 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 9277 trivial. 0 not checked. [2019-09-07 11:11:53,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:53,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:53,883 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:12:05,551 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-07 11:12:05,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:05,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 11:12:05,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9677 backedges. 4013 proven. 400 refuted. 0 times theorem prover too weak. 5264 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:12:05,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:05,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 26 [2019-09-07 11:12:05,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:12:05,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:12:05,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:12:05,732 INFO L87 Difference]: Start difference. First operand 384 states and 457 transitions. Second operand 26 states. [2019-09-07 11:12:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:06,184 INFO L93 Difference]: Finished difference Result 576 states and 694 transitions. [2019-09-07 11:12:06,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:12:06,185 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 380 [2019-09-07 11:12:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:06,187 INFO L225 Difference]: With dead ends: 576 [2019-09-07 11:12:06,188 INFO L226 Difference]: Without dead ends: 387 [2019-09-07 11:12:06,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=786, Invalid=1376, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 11:12:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-07 11:12:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 386. [2019-09-07 11:12:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-09-07 11:12:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 459 transitions. [2019-09-07 11:12:06,203 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 459 transitions. Word has length 380 [2019-09-07 11:12:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:06,204 INFO L475 AbstractCegarLoop]: Abstraction has 386 states and 459 transitions. [2019-09-07 11:12:06,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:12:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 459 transitions. [2019-09-07 11:12:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-07 11:12:06,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:06,207 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 22, 22, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:12:06,208 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1795872705, now seen corresponding path program 25 times [2019-09-07 11:12:06,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:06,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:06,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9718 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 9234 trivial. 0 not checked. [2019-09-07 11:12:06,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:06,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:12:06,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:12:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:06,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:12:06,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9718 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 9234 trivial. 0 not checked. [2019-09-07 11:12:06,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:06,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 11:12:06,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:12:06,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:12:06,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:12:06,904 INFO L87 Difference]: Start difference. First operand 386 states and 459 transitions. Second operand 26 states. [2019-09-07 11:12:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:07,006 INFO L93 Difference]: Finished difference Result 724 states and 870 transitions. [2019-09-07 11:12:07,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:12:07,006 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 382 [2019-09-07 11:12:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:07,008 INFO L225 Difference]: With dead ends: 724 [2019-09-07 11:12:07,008 INFO L226 Difference]: Without dead ends: 389 [2019-09-07 11:12:07,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 382 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-09-07 11:12:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-07 11:12:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 388. [2019-09-07 11:12:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-07 11:12:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 461 transitions. [2019-09-07 11:12:07,021 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 461 transitions. Word has length 382 [2019-09-07 11:12:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:07,021 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 461 transitions. [2019-09-07 11:12:07,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:12:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 461 transitions. [2019-09-07 11:12:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-07 11:12:07,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:07,026 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 23, 23, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:12:07,026 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash 464080259, now seen corresponding path program 26 times [2019-09-07 11:12:07,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:07,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:07,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:12:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9763 backedges. 0 proven. 4914 refuted. 0 times theorem prover too weak. 4849 trivial. 0 not checked. [2019-09-07 11:12:07,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:07,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:12:07,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:12:07,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:12:07,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:07,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:12:07,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9763 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 9234 trivial. 0 not checked. [2019-09-07 11:12:08,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:08,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2019-09-07 11:12:08,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 11:12:08,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 11:12:08,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:12:08,158 INFO L87 Difference]: Start difference. First operand 388 states and 461 transitions. Second operand 49 states. [2019-09-07 11:12:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:08,406 INFO L93 Difference]: Finished difference Result 747 states and 909 transitions. [2019-09-07 11:12:08,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 11:12:08,407 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 384 [2019-09-07 11:12:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:08,409 INFO L225 Difference]: With dead ends: 747 [2019-09-07 11:12:08,410 INFO L226 Difference]: Without dead ends: 412 [2019-09-07 11:12:08,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:12:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-07 11:12:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 402. [2019-09-07 11:12:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-07 11:12:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 478 transitions. [2019-09-07 11:12:08,438 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 478 transitions. Word has length 384 [2019-09-07 11:12:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:08,439 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 478 transitions. [2019-09-07 11:12:08,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 11:12:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 478 transitions. [2019-09-07 11:12:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-07 11:12:08,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:08,442 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 24, 24, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:12:08,442 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:08,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1250716576, now seen corresponding path program 27 times [2019-09-07 11:12:08,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:08,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10623 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10182 trivial. 0 not checked. [2019-09-07 11:12:08,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:08,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:12:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:12:27,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-07 11:12:27,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:27,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:12:27,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10623 backedges. 4334 proven. 441 refuted. 0 times theorem prover too weak. 5848 trivial. 0 not checked. [2019-09-07 11:12:27,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:27,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 11:12:27,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:12:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:12:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:12:27,946 INFO L87 Difference]: Start difference. First operand 402 states and 478 transitions. Second operand 25 states. [2019-09-07 11:12:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:28,050 INFO L93 Difference]: Finished difference Result 602 states and 725 transitions. [2019-09-07 11:12:28,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 11:12:28,050 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 398 [2019-09-07 11:12:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:28,054 INFO L225 Difference]: With dead ends: 602 [2019-09-07 11:12:28,054 INFO L226 Difference]: Without dead ends: 405 [2019-09-07 11:12:28,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 398 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-09-07 11:12:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-07 11:12:28,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2019-09-07 11:12:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-09-07 11:12:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 480 transitions. [2019-09-07 11:12:28,075 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 480 transitions. Word has length 398 [2019-09-07 11:12:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:28,077 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 480 transitions. [2019-09-07 11:12:28,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:12:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 480 transitions. [2019-09-07 11:12:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-07 11:12:28,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:28,083 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 24, 24, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:12:28,083 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2105993662, now seen corresponding path program 28 times [2019-09-07 11:12:28,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:28,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:28,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10666 backedges. 0 proven. 5367 refuted. 0 times theorem prover too weak. 5299 trivial. 0 not checked. [2019-09-07 11:12:28,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:28,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:12:28,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:12:28,842 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:12:28,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:28,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:12:28,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10666 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10090 trivial. 0 not checked. [2019-09-07 11:12:29,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:29,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 11:12:29,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 11:12:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 11:12:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 11:12:29,378 INFO L87 Difference]: Start difference. First operand 404 states and 480 transitions. Second operand 51 states. [2019-09-07 11:12:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:29,643 INFO L93 Difference]: Finished difference Result 777 states and 945 transitions. [2019-09-07 11:12:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 11:12:29,643 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 400 [2019-09-07 11:12:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:29,644 INFO L225 Difference]: With dead ends: 777 [2019-09-07 11:12:29,645 INFO L226 Difference]: Without dead ends: 428 [2019-09-07 11:12:29,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 11:12:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-09-07 11:12:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 418. [2019-09-07 11:12:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-07 11:12:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 497 transitions. [2019-09-07 11:12:29,658 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 497 transitions. Word has length 400 [2019-09-07 11:12:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:29,658 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 497 transitions. [2019-09-07 11:12:29,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 11:12:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 497 transitions. [2019-09-07 11:12:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-07 11:12:29,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:29,662 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 25, 25, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:12:29,662 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1044950501, now seen corresponding path program 29 times [2019-09-07 11:12:29,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:29,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:29,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11564 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 11080 trivial. 0 not checked. [2019-09-07 11:12:30,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:30,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:12:30,097 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:14:02,657 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2019-09-07 11:14:02,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:14:02,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:14:02,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:14:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11564 backedges. 4708 proven. 1128 refuted. 0 times theorem prover too weak. 5728 trivial. 0 not checked. [2019-09-07 11:14:03,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:14:03,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2019-09-07 11:14:03,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 11:14:03,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 11:14:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 11:14:03,394 INFO L87 Difference]: Start difference. First operand 418 states and 497 transitions. Second operand 50 states. [2019-09-07 11:14:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:14:03,605 INFO L93 Difference]: Finished difference Result 802 states and 974 transitions. [2019-09-07 11:14:03,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 11:14:03,606 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 414 [2019-09-07 11:14:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:14:03,608 INFO L225 Difference]: With dead ends: 802 [2019-09-07 11:14:03,608 INFO L226 Difference]: Without dead ends: 442 [2019-09-07 11:14:03,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 11:14:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-07 11:14:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2019-09-07 11:14:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-07 11:14:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 514 transitions. [2019-09-07 11:14:03,623 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 514 transitions. Word has length 414 [2019-09-07 11:14:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:14:03,623 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 514 transitions. [2019-09-07 11:14:03,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 11:14:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 514 transitions. [2019-09-07 11:14:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-07 11:14:03,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:14:03,627 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 25, 25, 23, 23, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:14:03,627 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:14:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:14:03,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1282367468, now seen corresponding path program 30 times [2019-09-07 11:14:03,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:14:03,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:14:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:03,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:14:03,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:14:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12494 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 11965 trivial. 0 not checked. [2019-09-07 11:14:04,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:14:04,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:14:04,099 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:14:17,377 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-07 11:14:17,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:14:17,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:14:17,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:14:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12494 backedges. 5110 proven. 529 refuted. 0 times theorem prover too weak. 6855 trivial. 0 not checked. [2019-09-07 11:14:17,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:14:17,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 11:14:17,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 11:14:17,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 11:14:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:14:17,476 INFO L87 Difference]: Start difference. First operand 432 states and 514 transitions. Second operand 27 states. [2019-09-07 11:14:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:14:17,550 INFO L93 Difference]: Finished difference Result 648 states and 781 transitions. [2019-09-07 11:14:17,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:14:17,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 428 [2019-09-07 11:14:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:14:17,554 INFO L225 Difference]: With dead ends: 648 [2019-09-07 11:14:17,554 INFO L226 Difference]: Without dead ends: 435 [2019-09-07 11:14:17,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 428 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-09-07 11:14:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-07 11:14:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 434. [2019-09-07 11:14:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-07 11:14:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 516 transitions. [2019-09-07 11:14:17,567 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 516 transitions. Word has length 428 [2019-09-07 11:14:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:14:17,568 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 516 transitions. [2019-09-07 11:14:17,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 11:14:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 516 transitions. [2019-09-07 11:14:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-07 11:14:17,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:14:17,571 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 25, 25, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:14:17,572 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:14:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:14:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1009074190, now seen corresponding path program 31 times [2019-09-07 11:14:17,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:14:17,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:14:17,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:17,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:14:17,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:14:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12541 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 11916 trivial. 0 not checked. [2019-09-07 11:14:18,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:14:18,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:14:18,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:14:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:14:18,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:14:18,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:14:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12541 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 11916 trivial. 0 not checked. [2019-09-07 11:14:18,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:14:18,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 11:14:18,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:14:18,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:14:18,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:14:18,370 INFO L87 Difference]: Start difference. First operand 434 states and 516 transitions. Second operand 29 states. [2019-09-07 11:14:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:14:18,453 INFO L93 Difference]: Finished difference Result 814 states and 978 transitions. [2019-09-07 11:14:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:14:18,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 430 [2019-09-07 11:14:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:14:18,459 INFO L225 Difference]: With dead ends: 814 [2019-09-07 11:14:18,459 INFO L226 Difference]: Without dead ends: 437 [2019-09-07 11:14:18,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 430 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-09-07 11:14:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-07 11:14:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2019-09-07 11:14:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-09-07 11:14:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 518 transitions. [2019-09-07 11:14:18,472 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 518 transitions. Word has length 430 [2019-09-07 11:14:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:14:18,473 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 518 transitions. [2019-09-07 11:14:18,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:14:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 518 transitions. [2019-09-07 11:14:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-09-07 11:14:18,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:14:18,477 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 26, 26, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:14:18,477 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:14:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:14:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash 169994676, now seen corresponding path program 32 times [2019-09-07 11:14:18,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:14:18,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:14:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:18,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:14:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:14:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12592 backedges. 0 proven. 6333 refuted. 0 times theorem prover too weak. 6259 trivial. 0 not checked. [2019-09-07 11:14:19,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:14:19,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:14:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:14:19,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:14:19,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:14:19,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:14:19,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:14:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12592 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 11916 trivial. 0 not checked. [2019-09-07 11:14:19,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:14:19,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2019-09-07 11:14:19,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 11:14:19,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 11:14:19,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 11:14:19,950 INFO L87 Difference]: Start difference. First operand 436 states and 518 transitions. Second operand 55 states. [2019-09-07 11:14:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:14:20,239 INFO L93 Difference]: Finished difference Result 837 states and 1017 transitions. [2019-09-07 11:14:20,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 11:14:20,253 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 432 [2019-09-07 11:14:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:14:20,256 INFO L225 Difference]: With dead ends: 837 [2019-09-07 11:14:20,256 INFO L226 Difference]: Without dead ends: 460 [2019-09-07 11:14:20,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 11:14:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-07 11:14:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 450. [2019-09-07 11:14:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-07 11:14:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 535 transitions. [2019-09-07 11:14:20,270 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 535 transitions. Word has length 432 [2019-09-07 11:14:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:14:20,270 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 535 transitions. [2019-09-07 11:14:20,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 11:14:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 535 transitions. [2019-09-07 11:14:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-09-07 11:14:20,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:14:20,274 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 27, 27, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:14:20,275 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:14:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:14:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1024305903, now seen corresponding path program 33 times [2019-09-07 11:14:20,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:14:20,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:14:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:20,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:14:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:14:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13566 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 12990 trivial. 0 not checked. [2019-09-07 11:14:20,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:14:20,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:14:20,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:14:44,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-07 11:14:44,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:14:44,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 11:14:44,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:14:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13566 backedges. 5575 proven. 576 refuted. 0 times theorem prover too weak. 7415 trivial. 0 not checked. [2019-09-07 11:14:44,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:14:44,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 30 [2019-09-07 11:14:44,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:14:44,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:14:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:14:44,706 INFO L87 Difference]: Start difference. First operand 450 states and 535 transitions. Second operand 30 states. [2019-09-07 11:14:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:14:45,188 INFO L93 Difference]: Finished difference Result 674 states and 812 transitions. [2019-09-07 11:14:45,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 11:14:45,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 446 [2019-09-07 11:14:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:14:45,191 INFO L225 Difference]: With dead ends: 674 [2019-09-07 11:14:45,191 INFO L226 Difference]: Without dead ends: 453 [2019-09-07 11:14:45,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1084, Invalid=1886, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 11:14:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-07 11:14:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-09-07 11:14:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-07 11:14:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 537 transitions. [2019-09-07 11:14:45,203 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 537 transitions. Word has length 446 [2019-09-07 11:14:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:14:45,203 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 537 transitions. [2019-09-07 11:14:45,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:14:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 537 transitions. [2019-09-07 11:14:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-07 11:14:45,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:14:45,207 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 27, 27, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:14:45,207 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:14:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:14:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash -235614865, now seen corresponding path program 34 times [2019-09-07 11:14:45,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:14:45,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:14:45,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:45,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:14:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:14:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13615 backedges. 0 proven. 6846 refuted. 0 times theorem prover too weak. 6769 trivial. 0 not checked. [2019-09-07 11:14:45,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:14:45,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:14:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:14:46,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:14:46,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:14:46,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:14:46,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:14:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13615 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 12886 trivial. 0 not checked. [2019-09-07 11:14:46,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:14:46,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2019-09-07 11:14:46,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 11:14:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 11:14:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 11:14:46,803 INFO L87 Difference]: Start difference. First operand 452 states and 537 transitions. Second operand 57 states. [2019-09-07 11:14:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:14:47,066 INFO L93 Difference]: Finished difference Result 867 states and 1053 transitions. [2019-09-07 11:14:47,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 11:14:47,066 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 448 [2019-09-07 11:14:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:14:47,068 INFO L225 Difference]: With dead ends: 867 [2019-09-07 11:14:47,068 INFO L226 Difference]: Without dead ends: 476 [2019-09-07 11:14:47,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 11:14:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-07 11:14:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 466. [2019-09-07 11:14:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-07 11:14:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 554 transitions. [2019-09-07 11:14:47,082 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 554 transitions. Word has length 448 [2019-09-07 11:14:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:14:47,082 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 554 transitions. [2019-09-07 11:14:47,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 11:14:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 554 transitions. [2019-09-07 11:14:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-09-07 11:14:47,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:14:47,086 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 28, 28, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:14:47,086 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:14:47,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:14:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash 455023180, now seen corresponding path program 35 times [2019-09-07 11:14:47,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:14:47,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:14:47,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:47,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:14:47,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:14:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:14:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14627 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 14002 trivial. 0 not checked. [2019-09-07 11:14:47,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:14:47,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:14:47,595 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:17:02,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-07 11:17:02,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:17:02,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:17:02,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14627 backedges. 5944 proven. 1431 refuted. 0 times theorem prover too weak. 7252 trivial. 0 not checked. [2019-09-07 11:17:02,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:02,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2019-09-07 11:17:02,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 11:17:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 11:17:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 11:17:02,935 INFO L87 Difference]: Start difference. First operand 466 states and 554 transitions. Second operand 56 states. [2019-09-07 11:17:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:03,148 INFO L93 Difference]: Finished difference Result 892 states and 1082 transitions. [2019-09-07 11:17:03,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 11:17:03,148 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 462 [2019-09-07 11:17:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:03,151 INFO L225 Difference]: With dead ends: 892 [2019-09-07 11:17:03,152 INFO L226 Difference]: Without dead ends: 490 [2019-09-07 11:17:03,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 11:17:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-07 11:17:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 480. [2019-09-07 11:17:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-07 11:17:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 571 transitions. [2019-09-07 11:17:03,166 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 571 transitions. Word has length 462 [2019-09-07 11:17:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:03,167 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 571 transitions. [2019-09-07 11:17:03,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 11:17:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 571 transitions. [2019-09-07 11:17:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-07 11:17:03,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:03,171 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 28, 28, 26, 26, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:03,171 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:03,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash -476316731, now seen corresponding path program 36 times [2019-09-07 11:17:03,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:03,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:03,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:17:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15671 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 14995 trivial. 0 not checked. [2019-09-07 11:17:03,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:03,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:17:30,168 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-07 11:17:30,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:17:30,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 11:17:30,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15671 backedges. 6449 proven. 676 refuted. 0 times theorem prover too weak. 8546 trivial. 0 not checked. [2019-09-07 11:17:30,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:30,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 32 [2019-09-07 11:17:30,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:17:30,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:17:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:17:30,349 INFO L87 Difference]: Start difference. First operand 480 states and 571 transitions. Second operand 32 states. [2019-09-07 11:17:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:30,891 INFO L93 Difference]: Finished difference Result 720 states and 868 transitions. [2019-09-07 11:17:30,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:17:30,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 476 [2019-09-07 11:17:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:30,893 INFO L225 Difference]: With dead ends: 720 [2019-09-07 11:17:30,893 INFO L226 Difference]: Without dead ends: 483 [2019-09-07 11:17:30,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1251, Invalid=2171, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 11:17:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-07 11:17:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 482. [2019-09-07 11:17:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-07 11:17:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 573 transitions. [2019-09-07 11:17:30,903 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 573 transitions. Word has length 476 [2019-09-07 11:17:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:30,903 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 573 transitions. [2019-09-07 11:17:30,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:17:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 573 transitions. [2019-09-07 11:17:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-07 11:17:30,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:30,906 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 28, 28, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:30,906 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:30,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:30,907 INFO L82 PathProgramCache]: Analyzing trace with hash -948224349, now seen corresponding path program 37 times [2019-09-07 11:17:30,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:30,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:30,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:30,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:17:30,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15724 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 14940 trivial. 0 not checked. [2019-09-07 11:17:31,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:31,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:31,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:17:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:31,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 11:17:31,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15724 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 14940 trivial. 0 not checked. [2019-09-07 11:17:31,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 11:17:31,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:17:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:17:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:17:31,847 INFO L87 Difference]: Start difference. First operand 482 states and 573 transitions. Second operand 32 states. [2019-09-07 11:17:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:31,939 INFO L93 Difference]: Finished difference Result 904 states and 1086 transitions. [2019-09-07 11:17:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:17:31,940 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 478 [2019-09-07 11:17:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:31,941 INFO L225 Difference]: With dead ends: 904 [2019-09-07 11:17:31,941 INFO L226 Difference]: Without dead ends: 485 [2019-09-07 11:17:31,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:17:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-07 11:17:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-09-07 11:17:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-07 11:17:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 575 transitions. [2019-09-07 11:17:31,955 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 575 transitions. Word has length 478 [2019-09-07 11:17:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:31,956 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 575 transitions. [2019-09-07 11:17:31,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:17:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 575 transitions. [2019-09-07 11:17:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-07 11:17:31,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:31,960 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 29, 29, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:31,960 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1941118053, now seen corresponding path program 38 times [2019-09-07 11:17:31,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:31,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:31,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:31,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:17:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15781 backedges. 0 proven. 7932 refuted. 0 times theorem prover too weak. 7849 trivial. 0 not checked. [2019-09-07 11:17:32,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:32,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:32,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:17:32,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:17:32,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:17:32,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:17:32,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:17:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15781 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 14940 trivial. 0 not checked. [2019-09-07 11:17:33,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:17:33,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2019-09-07 11:17:33,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 11:17:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 11:17:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 11:17:33,473 INFO L87 Difference]: Start difference. First operand 484 states and 575 transitions. Second operand 61 states. [2019-09-07 11:17:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:17:33,743 INFO L93 Difference]: Finished difference Result 927 states and 1125 transitions. [2019-09-07 11:17:33,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 11:17:33,743 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 480 [2019-09-07 11:17:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:17:33,745 INFO L225 Difference]: With dead ends: 927 [2019-09-07 11:17:33,745 INFO L226 Difference]: Without dead ends: 508 [2019-09-07 11:17:33,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 11:17:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-09-07 11:17:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 498. [2019-09-07 11:17:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-07 11:17:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 592 transitions. [2019-09-07 11:17:33,758 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 592 transitions. Word has length 480 [2019-09-07 11:17:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:17:33,759 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 592 transitions. [2019-09-07 11:17:33,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 11:17:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 592 transitions. [2019-09-07 11:17:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2019-09-07 11:17:33,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:17:33,763 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 30, 30, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:17:33,763 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:17:33,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:17:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash -520819646, now seen corresponding path program 39 times [2019-09-07 11:17:33,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:17:33,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:17:33,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:33,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:17:33,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:17:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:17:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16869 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 16140 trivial. 0 not checked. [2019-09-07 11:17:34,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:17:34,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:17:34,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:18:11,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-07 11:18:11,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:11,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 11:18:11,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16869 backedges. 6854 proven. 729 refuted. 0 times theorem prover too weak. 9286 trivial. 0 not checked. [2019-09-07 11:18:11,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:11,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 11:18:11,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:18:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:18:11,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:18:11,964 INFO L87 Difference]: Start difference. First operand 498 states and 592 transitions. Second operand 31 states. [2019-09-07 11:18:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:12,052 INFO L93 Difference]: Finished difference Result 746 states and 899 transitions. [2019-09-07 11:18:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 11:18:12,056 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 494 [2019-09-07 11:18:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:12,059 INFO L225 Difference]: With dead ends: 746 [2019-09-07 11:18:12,059 INFO L226 Difference]: Without dead ends: 501 [2019-09-07 11:18:12,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 494 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-09-07 11:18:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-07 11:18:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2019-09-07 11:18:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-07 11:18:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 594 transitions. [2019-09-07 11:18:12,072 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 594 transitions. Word has length 494 [2019-09-07 11:18:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:12,072 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 594 transitions. [2019-09-07 11:18:12,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:18:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 594 transitions. [2019-09-07 11:18:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-07 11:18:12,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:12,077 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 30, 30, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:12,077 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1600911456, now seen corresponding path program 40 times [2019-09-07 11:18:12,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:12,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:12,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16924 backedges. 0 proven. 8505 refuted. 0 times theorem prover too weak. 8419 trivial. 0 not checked. [2019-09-07 11:18:12,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:12,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:18:12,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:18:12,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:18:12,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:12,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:18:12,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16924 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 16024 trivial. 0 not checked. [2019-09-07 11:18:13,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:13,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 63 [2019-09-07 11:18:13,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 11:18:13,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 11:18:13,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 11:18:13,695 INFO L87 Difference]: Start difference. First operand 500 states and 594 transitions. Second operand 63 states. [2019-09-07 11:18:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:13,990 INFO L93 Difference]: Finished difference Result 957 states and 1161 transitions. [2019-09-07 11:18:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 11:18:13,991 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 496 [2019-09-07 11:18:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:13,992 INFO L225 Difference]: With dead ends: 957 [2019-09-07 11:18:13,992 INFO L226 Difference]: Without dead ends: 524 [2019-09-07 11:18:13,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 11:18:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-07 11:18:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 514. [2019-09-07 11:18:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-07 11:18:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 611 transitions. [2019-09-07 11:18:14,006 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 611 transitions. Word has length 496 [2019-09-07 11:18:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:14,007 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 611 transitions. [2019-09-07 11:18:14,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 11:18:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 611 transitions. [2019-09-07 11:18:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-09-07 11:18:14,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:14,011 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 31, 31, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:14,011 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1739815165, now seen corresponding path program 41 times [2019-09-07 11:18:14,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:14,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:14,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:14,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:14,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18050 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 17266 trivial. 0 not checked. [2019-09-07 11:18:14,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:14,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:18:14,660 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:21:14,788 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-09-07 11:21:14,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:14,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:21:14,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18050 backedges. 7324 proven. 1770 refuted. 0 times theorem prover too weak. 8956 trivial. 0 not checked. [2019-09-07 11:21:15,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:15,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 62 [2019-09-07 11:21:15,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 11:21:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 11:21:15,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 11:21:15,664 INFO L87 Difference]: Start difference. First operand 514 states and 611 transitions. Second operand 62 states. [2019-09-07 11:21:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:15,961 INFO L93 Difference]: Finished difference Result 982 states and 1190 transitions. [2019-09-07 11:21:15,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 11:21:15,962 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 510 [2019-09-07 11:21:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:15,964 INFO L225 Difference]: With dead ends: 982 [2019-09-07 11:21:15,964 INFO L226 Difference]: Without dead ends: 538 [2019-09-07 11:21:15,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 11:21:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-07 11:21:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 528. [2019-09-07 11:21:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-07 11:21:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 628 transitions. [2019-09-07 11:21:15,977 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 628 transitions. Word has length 510 [2019-09-07 11:21:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:15,977 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 628 transitions. [2019-09-07 11:21:15,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 11:21:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 628 transitions. [2019-09-07 11:21:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-07 11:21:15,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:15,982 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 31, 31, 29, 29, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:15,982 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 973385206, now seen corresponding path program 42 times [2019-09-07 11:21:15,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:15,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:15,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 18367 trivial. 0 not checked. [2019-09-07 11:21:16,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:16,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:16,691 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:22:19,919 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-07 11:22:19,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:22:19,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 11:22:19,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 7822 proven. 841 refuted. 0 times theorem prover too weak. 10545 trivial. 0 not checked. [2019-09-07 11:22:20,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:20,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 11:22:20,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:22:20,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:22:20,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:22:20,078 INFO L87 Difference]: Start difference. First operand 528 states and 628 transitions. Second operand 33 states. [2019-09-07 11:22:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:20,195 INFO L93 Difference]: Finished difference Result 792 states and 955 transitions. [2019-09-07 11:22:20,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:22:20,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 524 [2019-09-07 11:22:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:20,197 INFO L225 Difference]: With dead ends: 792 [2019-09-07 11:22:20,197 INFO L226 Difference]: Without dead ends: 531 [2019-09-07 11:22:20,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 524 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-09-07 11:22:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-07 11:22:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 530. [2019-09-07 11:22:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-09-07 11:22:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 630 transitions. [2019-09-07 11:22:20,211 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 630 transitions. Word has length 524 [2019-09-07 11:22:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:20,211 INFO L475 AbstractCegarLoop]: Abstraction has 530 states and 630 transitions. [2019-09-07 11:22:20,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:22:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 630 transitions. [2019-09-07 11:22:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-07 11:22:20,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:20,216 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 31, 31, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:20,216 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:20,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1067881428, now seen corresponding path program 43 times [2019-09-07 11:22:20,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:20,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:20,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:20,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:20,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 19267 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 18306 trivial. 0 not checked. [2019-09-07 11:22:20,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:20,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:22:20,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:22:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:21,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:22:21,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 19267 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 18306 trivial. 0 not checked. [2019-09-07 11:22:21,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:21,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 11:22:21,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 11:22:21,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 11:22:21,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:22:21,286 INFO L87 Difference]: Start difference. First operand 530 states and 630 transitions. Second operand 35 states. [2019-09-07 11:22:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:21,403 INFO L93 Difference]: Finished difference Result 994 states and 1194 transitions. [2019-09-07 11:22:21,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 11:22:21,406 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 526 [2019-09-07 11:22:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:21,408 INFO L225 Difference]: With dead ends: 994 [2019-09-07 11:22:21,408 INFO L226 Difference]: Without dead ends: 533 [2019-09-07 11:22:21,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:22:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-07 11:22:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 532. [2019-09-07 11:22:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-09-07 11:22:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 632 transitions. [2019-09-07 11:22:21,422 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 632 transitions. Word has length 526 [2019-09-07 11:22:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:21,422 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 632 transitions. [2019-09-07 11:22:21,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 11:22:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 632 transitions. [2019-09-07 11:22:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-09-07 11:22:21,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:21,427 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 32, 32, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:21,427 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1914119574, now seen corresponding path program 44 times [2019-09-07 11:22:21,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:21,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:22:21,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19330 backedges. 0 proven. 9711 refuted. 0 times theorem prover too weak. 9619 trivial. 0 not checked. [2019-09-07 11:22:22,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:22,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:22:22,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:22:22,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:22:22,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:22:22,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:22:22,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19330 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 18306 trivial. 0 not checked. [2019-09-07 11:22:23,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:23,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 67 [2019-09-07 11:22:23,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 11:22:23,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 11:22:23,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:22:23,229 INFO L87 Difference]: Start difference. First operand 532 states and 632 transitions. Second operand 67 states. [2019-09-07 11:22:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:23,552 INFO L93 Difference]: Finished difference Result 1017 states and 1233 transitions. [2019-09-07 11:22:23,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 11:22:23,552 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 528 [2019-09-07 11:22:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:23,554 INFO L225 Difference]: With dead ends: 1017 [2019-09-07 11:22:23,554 INFO L226 Difference]: Without dead ends: 556 [2019-09-07 11:22:23,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:22:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-07 11:22:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 546. [2019-09-07 11:22:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-07 11:22:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 649 transitions. [2019-09-07 11:22:23,568 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 649 transitions. Word has length 528 [2019-09-07 11:22:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:23,568 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 649 transitions. [2019-09-07 11:22:23,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 11:22:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 649 transitions. [2019-09-07 11:22:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-07 11:22:23,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:23,573 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 33, 33, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:23,574 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash 65378803, now seen corresponding path program 45 times [2019-09-07 11:22:23,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:23,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:23,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20532 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 19632 trivial. 0 not checked. [2019-09-07 11:22:24,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:24,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:22:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:23:25,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-07 11:23:25,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:23:25,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 11:23:25,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:23:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20532 backedges. 8395 proven. 900 refuted. 0 times theorem prover too weak. 11237 trivial. 0 not checked. [2019-09-07 11:23:25,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:23:25,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 36 [2019-09-07 11:23:25,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:23:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:23:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:23:25,538 INFO L87 Difference]: Start difference. First operand 546 states and 649 transitions. Second operand 36 states. [2019-09-07 11:23:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:23:26,251 INFO L93 Difference]: Finished difference Result 818 states and 986 transitions. [2019-09-07 11:23:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:23:26,252 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 542 [2019-09-07 11:23:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:23:26,254 INFO L225 Difference]: With dead ends: 818 [2019-09-07 11:23:26,254 INFO L226 Difference]: Without dead ends: 549 [2019-09-07 11:23:26,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1621, Invalid=2801, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:23:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-07 11:23:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 548. [2019-09-07 11:23:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-07 11:23:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 651 transitions. [2019-09-07 11:23:26,270 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 651 transitions. Word has length 542 [2019-09-07 11:23:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:23:26,271 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 651 transitions. [2019-09-07 11:23:26,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 11:23:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 651 transitions. [2019-09-07 11:23:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2019-09-07 11:23:26,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:23:26,276 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 33, 33, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:23:26,276 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:23:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:23:26,276 INFO L82 PathProgramCache]: Analyzing trace with hash -946939823, now seen corresponding path program 46 times [2019-09-07 11:23:26,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:23:26,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:23:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:26,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:23:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:23:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20593 backedges. 0 proven. 10344 refuted. 0 times theorem prover too weak. 10249 trivial. 0 not checked. [2019-09-07 11:23:27,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:23:27,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:23:27,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:23:27,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:23:27,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:23:27,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 1593 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:23:27,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:23:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 20593 backedges. 8328 proven. 2016 refuted. 0 times theorem prover too weak. 10249 trivial. 0 not checked. [2019-09-07 11:23:27,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:23:27,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 11:23:27,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:23:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:23:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:23:27,504 INFO L87 Difference]: Start difference. First operand 548 states and 651 transitions. Second operand 36 states. [2019-09-07 11:23:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:23:27,667 INFO L93 Difference]: Finished difference Result 1043 states and 1262 transitions. [2019-09-07 11:23:27,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:23:27,667 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 544 [2019-09-07 11:23:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:23:27,670 INFO L225 Difference]: With dead ends: 1043 [2019-09-07 11:23:27,670 INFO L226 Difference]: Without dead ends: 569 [2019-09-07 11:23:27,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:23:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-07 11:23:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 560. [2019-09-07 11:23:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-07 11:23:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 666 transitions. [2019-09-07 11:23:27,684 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 666 transitions. Word has length 544 [2019-09-07 11:23:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:23:27,684 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 666 transitions. [2019-09-07 11:23:27,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 11:23:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 666 transitions. [2019-09-07 11:23:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-07 11:23:27,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:23:27,690 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 99, 98, 33, 33, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:23:27,690 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:23:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:23:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash 805968876, now seen corresponding path program 47 times [2019-09-07 11:23:27,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:23:27,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:23:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:27,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:23:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:23:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21766 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 20805 trivial. 0 not checked. [2019-09-07 11:23:28,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:23:28,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:23:28,847 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1