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/loop-new/count_by_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:03:53,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:03:53,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:03:53,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:03:53,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:03:53,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:03:53,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:03:53,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:03:53,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:03:53,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:03:53,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:03:53,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:03:53,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:03:53,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:03:53,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:03:53,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:03:53,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:03:53,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:03:53,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:03:53,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:03:53,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:03:53,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:03:53,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:03:53,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:03:53,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:03:53,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:03:53,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:03:53,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:03:53,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:03:53,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:03:53,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:03:53,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:03:53,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:03:53,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:03:54,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:03:54,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:03:54,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:03:54,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:03:54,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:03:54,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:03:54,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:03:54,007 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-05 12:03:54,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:03:54,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:03:54,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 12:03:54,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 12:03:54,033 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 12:03:54,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:03:54,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:03:54,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 12:03:54,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:03:54,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:03:54,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:03:54,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:03:54,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:03:54,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:03:54,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:03:54,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 12:03:54,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:03:54,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:03:54,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:03:54,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 12:03:54,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 12:03:54,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:03:54,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:03:54,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:03:54,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 12:03:54,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 12:03:54,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:03:54,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:03:54,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 12:03:54,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:03:54,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:03:54,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:03:54,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:03:54,099 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:03:54,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_2.i [2019-09-05 12:03:54,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b5f2e12/2112cc4fa22a450e8b60c509de18be4f/FLAG41ab9c90d [2019-09-05 12:03:54,607 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:03:54,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_2.i [2019-09-05 12:03:54,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b5f2e12/2112cc4fa22a450e8b60c509de18be4f/FLAG41ab9c90d [2019-09-05 12:03:54,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b5f2e12/2112cc4fa22a450e8b60c509de18be4f [2019-09-05 12:03:55,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:03:55,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:03:55,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:03:55,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:03:55,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:03:55,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:03:54" (1/1) ... [2019-09-05 12:03:55,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b67bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55, skipping insertion in model container [2019-09-05 12:03:55,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:03:54" (1/1) ... [2019-09-05 12:03:55,021 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:03:55,037 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:03:55,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:03:55,280 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:03:55,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:03:55,317 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:03:55,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55 WrapperNode [2019-09-05 12:03:55,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:03:55,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:03:55,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:03:55,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:03:55,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (1/1) ... [2019-09-05 12:03:55,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (1/1) ... [2019-09-05 12:03:55,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (1/1) ... [2019-09-05 12:03:55,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (1/1) ... [2019-09-05 12:03:55,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (1/1) ... [2019-09-05 12:03:55,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (1/1) ... [2019-09-05 12:03:55,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (1/1) ... [2019-09-05 12:03:55,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:03:55,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:03:55,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:03:55,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:03:55,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (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-05 12:03:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:03:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:03:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:03:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:03:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:03:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 12:03:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:03:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:03:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:03:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:03:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:03:55,651 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:03:55,652 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:03:55,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:03:55 BoogieIcfgContainer [2019-09-05 12:03:55,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:03:55,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:03:55,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:03:55,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:03:55,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:03:54" (1/3) ... [2019-09-05 12:03:55,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149470cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:03:55, skipping insertion in model container [2019-09-05 12:03:55,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:55" (2/3) ... [2019-09-05 12:03:55,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149470cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:03:55, skipping insertion in model container [2019-09-05 12:03:55,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:03:55" (3/3) ... [2019-09-05 12:03:55,661 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_2.i [2019-09-05 12:03:55,671 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:03:55,678 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:03:55,694 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:03:55,723 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 12:03:55,724 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:03:55,724 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 12:03:55,724 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:03:55,725 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:03:55,725 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:03:55,725 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:03:55,725 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:03:55,725 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:03:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-05 12:03:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:03:55,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:55,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:55,752 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2019-09-05 12:03:55,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:55,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:55,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:55,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:03:55,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:03:55,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:03:55,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:03:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:03:55,879 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-05 12:03:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:55,902 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-05 12:03:55,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:03:55,903 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 12:03:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:55,911 INFO L225 Difference]: With dead ends: 31 [2019-09-05 12:03:55,911 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 12:03:55,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:03:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 12:03:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 12:03:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 12:03:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-05 12:03:55,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-05 12:03:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:55,952 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-05 12:03:55,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:03:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-05 12:03:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:03:55,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:55,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:55,953 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:55,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1877050693, now seen corresponding path program 1 times [2019-09-05 12:03:55,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:55,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:55,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:55,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:03:56,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:03:56,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:03:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:03:56,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:03:56,018 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-05 12:03:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:56,071 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-05 12:03:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:03:56,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 12:03:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:56,074 INFO L225 Difference]: With dead ends: 19 [2019-09-05 12:03:56,074 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 12:03:56,075 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-05 12:03:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 12:03:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-05 12:03:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 12:03:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-05 12:03:56,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-05 12:03:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:56,083 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-05 12:03:56,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:03:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-05 12:03:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 12:03:56,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:56,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:56,085 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1175909113, now seen corresponding path program 1 times [2019-09-05 12:03:56,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:56,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:56,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:56,119 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-05 12:03:56,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 12:03:56,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:56,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-05 12:03:56,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:03:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:03:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:03:56,233 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-05 12:03:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:56,264 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-05 12:03:56,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:03:56,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 12:03:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:56,265 INFO L225 Difference]: With dead ends: 21 [2019-09-05 12:03:56,266 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 12:03:56,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-05 12:03:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 12:03:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-05 12:03:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 12:03:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-05 12:03:56,271 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-05 12:03:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:56,271 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-05 12:03:56,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:03:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-05 12:03:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:03:56,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:56,272 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:56,273 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1607619511, now seen corresponding path program 2 times [2019-09-05 12:03:56,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:56,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:56,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:56,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:56,328 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:03:56,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:03:56,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:56,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 12:03:56,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:03:56,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:56,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-05 12:03:56,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:03:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:03:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:03:56,394 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-05 12:03:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:56,423 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-05 12:03:56,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:03:56,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-05 12:03:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:56,425 INFO L225 Difference]: With dead ends: 23 [2019-09-05 12:03:56,425 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 12:03:56,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-05 12:03:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 12:03:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-05 12:03:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 12:03:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-05 12:03:56,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-05 12:03:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:56,430 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-05 12:03:56,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:03:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-05 12:03:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 12:03:56,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:56,431 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:56,431 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash -130515723, now seen corresponding path program 3 times [2019-09-05 12:03:56,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:56,485 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-05 12:03:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:03:56,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 12:03:56,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:56,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 12:03:56,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:56,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-05 12:03:56,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:03:56,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:03:56,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:03:56,541 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-05 12:03:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:56,586 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-05 12:03:56,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:03:56,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-05 12:03:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:56,588 INFO L225 Difference]: With dead ends: 25 [2019-09-05 12:03:56,588 INFO L226 Difference]: Without dead ends: 20 [2019-09-05 12:03:56,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:03:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-05 12:03:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-05 12:03:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 12:03:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-05 12:03:56,599 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-05 12:03:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:56,599 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-05 12:03:56,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:03:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-05 12:03:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 12:03:56,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:56,601 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:56,601 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash 263802547, now seen corresponding path program 4 times [2019-09-05 12:03:56,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:56,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:56,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:03:56,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:56,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:56,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:56,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 12:03:56,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:56,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-05 12:03:56,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:03:56,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:03:56,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:03:56,755 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-05 12:03:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:56,797 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-05 12:03:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:03:56,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-05 12:03:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:56,799 INFO L225 Difference]: With dead ends: 27 [2019-09-05 12:03:56,799 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 12:03:56,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:03:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 12:03:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-05 12:03:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 12:03:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-05 12:03:56,804 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-05 12:03:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:56,805 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-05 12:03:56,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:03:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-05 12:03:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:03:56,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:56,806 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:56,806 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1246537969, now seen corresponding path program 5 times [2019-09-05 12:03:56,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:56,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:56,912 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-05 12:03:56,935 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:56,953 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 12:03:56,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:56,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 12:03:56,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:56,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:56,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-05 12:03:56,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:03:56,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:03:56,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:03:56,994 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-05 12:03:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:57,042 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-05 12:03:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:03:57,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-05 12:03:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:57,044 INFO L225 Difference]: With dead ends: 29 [2019-09-05 12:03:57,045 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 12:03:57,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:03:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 12:03:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-05 12:03:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 12:03:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-05 12:03:57,068 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-05 12:03:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:57,070 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-05 12:03:57,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:03:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-05 12:03:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 12:03:57,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:57,071 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:57,072 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash 762473391, now seen corresponding path program 6 times [2019-09-05 12:03:57,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:57,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:57,145 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-05 12:03:57,164 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:03:57,176 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 12:03:57,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:57,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 12:03:57,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:57,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:57,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-05 12:03:57,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:03:57,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:03:57,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:03:57,199 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-05 12:03:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:57,247 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-05 12:03:57,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:03:57,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-05 12:03:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:57,250 INFO L225 Difference]: With dead ends: 31 [2019-09-05 12:03:57,251 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 12:03:57,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:03:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 12:03:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-05 12:03:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 12:03:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-05 12:03:57,258 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-05 12:03:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:57,259 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-05 12:03:57,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:03:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-05 12:03:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 12:03:57,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:57,261 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:57,261 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash -567118099, now seen corresponding path program 7 times [2019-09-05 12:03:57,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:57,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:57,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:57,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:57,372 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:57,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:57,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 12:03:57,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:57,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:57,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-05 12:03:57,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:03:57,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:03:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:03:57,428 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-05 12:03:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:57,479 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-05 12:03:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:03:57,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-05 12:03:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:57,484 INFO L225 Difference]: With dead ends: 33 [2019-09-05 12:03:57,484 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 12:03:57,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:03:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 12:03:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-05 12:03:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 12:03:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-05 12:03:57,495 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-05 12:03:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:57,495 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-05 12:03:57,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:03:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-05 12:03:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 12:03:57,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:57,499 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:57,499 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1595714219, now seen corresponding path program 8 times [2019-09-05 12:03:57,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:57,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:57,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:57,622 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-05 12:03:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:57,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:03:57,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:57,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 12:03:57,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:57,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:57,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-05 12:03:57,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:03:57,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:03:57,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:03:57,684 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-05 12:03:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:57,730 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-05 12:03:57,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:03:57,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-05 12:03:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:57,732 INFO L225 Difference]: With dead ends: 35 [2019-09-05 12:03:57,733 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 12:03:57,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:03:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 12:03:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-05 12:03:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 12:03:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-05 12:03:57,742 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-05 12:03:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:57,742 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-05 12:03:57,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:03:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-05 12:03:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 12:03:57,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:57,744 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:57,744 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400553, now seen corresponding path program 9 times [2019-09-05 12:03:57,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:57,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:57,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:57,866 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) [2019-09-05 12:03:57,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:57,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 12:03:57,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:57,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 12:03:57,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:03:57,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:57,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-05 12:03:57,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:03:57,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:03:57,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:03:57,910 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-05 12:03:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:57,947 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-05 12:03:57,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:03:57,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-05 12:03:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:57,949 INFO L225 Difference]: With dead ends: 37 [2019-09-05 12:03:57,950 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 12:03:57,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:03:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 12:03:57,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-05 12:03:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 12:03:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-05 12:03:57,955 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-05 12:03:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:57,955 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-05 12:03:57,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:03:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-05 12:03:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 12:03:57,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:57,957 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:57,957 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:57,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:57,957 INFO L82 PathProgramCache]: Analyzing trace with hash 592907175, now seen corresponding path program 10 times [2019-09-05 12:03:57,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:57,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:58,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:58,085 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) [2019-09-05 12:03:58,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:58,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:58,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:58,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 12:03:58,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:58,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:58,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-05 12:03:58,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:03:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:03:58,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:03:58,161 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2019-09-05 12:03:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:58,240 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-05 12:03:58,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:03:58,241 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-05 12:03:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:58,241 INFO L225 Difference]: With dead ends: 39 [2019-09-05 12:03:58,242 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 12:03:58,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:03:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 12:03:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-05 12:03:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 12:03:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 12:03:58,253 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-05 12:03:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:58,253 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 12:03:58,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:03:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 12:03:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 12:03:58,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:58,254 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:58,258 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash -311494427, now seen corresponding path program 11 times [2019-09-05 12:03:58,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:58,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:58,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:58,383 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-05 12:03:58,393 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:03:58,405 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 12:03:58,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:58,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:03:58,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:03:58,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:58,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-05 12:03:58,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:03:58,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:03:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:03:58,428 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-09-05 12:03:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:58,470 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-05 12:03:58,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:03:58,470 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-09-05 12:03:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:58,471 INFO L225 Difference]: With dead ends: 41 [2019-09-05 12:03:58,471 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 12:03:58,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:03:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 12:03:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-05 12:03:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 12:03:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-05 12:03:58,476 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-05 12:03:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:58,476 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-05 12:03:58,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:03:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-05 12:03:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 12:03:58,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:58,478 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:58,478 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1858040157, now seen corresponding path program 12 times [2019-09-05 12:03:58,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:58,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:58,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:58,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:58,657 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) [2019-09-05 12:03:58,672 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:58,688 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 12:03:58,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:58,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 12:03:58,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:58,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:58,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-05 12:03:58,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:03:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:03:58,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:03:58,724 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-09-05 12:03:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:58,775 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-05 12:03:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:03:58,775 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-05 12:03:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:58,776 INFO L225 Difference]: With dead ends: 43 [2019-09-05 12:03:58,776 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 12:03:58,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:03:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 12:03:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-05 12:03:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 12:03:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-05 12:03:58,789 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-05 12:03:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:58,789 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-05 12:03:58,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:03:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-05 12:03:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 12:03:58,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:58,793 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:58,793 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:58,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:58,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2029802271, now seen corresponding path program 13 times [2019-09-05 12:03:58,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:58,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:58,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:58,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:58,964 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:58,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:58,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:03:58,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:59,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:59,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-05 12:03:59,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:03:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:03:59,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:03:59,015 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-09-05 12:03:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:59,070 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 12:03:59,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:03:59,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-09-05 12:03:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:59,073 INFO L225 Difference]: With dead ends: 45 [2019-09-05 12:03:59,073 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 12:03:59,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:03:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 12:03:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-05 12:03:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 12:03:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-05 12:03:59,079 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-05 12:03:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:59,079 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-05 12:03:59,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:03:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-05 12:03:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:03:59,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:59,080 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:59,080 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash 410530719, now seen corresponding path program 14 times [2019-09-05 12:03:59,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:59,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:59,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:59,237 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:59,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:03:59,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:03:59,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:59,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 12:03:59,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:59,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-05 12:03:59,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:03:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:03:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:03:59,311 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-09-05 12:03:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:59,372 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-05 12:03:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:03:59,372 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-09-05 12:03:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:59,373 INFO L225 Difference]: With dead ends: 47 [2019-09-05 12:03:59,373 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 12:03:59,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:03:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 12:03:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-05 12:03:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 12:03:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-05 12:03:59,379 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-05 12:03:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:59,379 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-05 12:03:59,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:03:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-05 12:03:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 12:03:59,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:59,380 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:59,380 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash 518390493, now seen corresponding path program 15 times [2019-09-05 12:03:59,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:59,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:59,528 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-05 12:03:59,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:03:59,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 12:03:59,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:59,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:03:59,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:59,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:59,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-05 12:03:59,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 12:03:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 12:03:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-05 12:03:59,581 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-09-05 12:03:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:59,646 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-05 12:03:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 12:03:59,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-09-05 12:03:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:59,648 INFO L225 Difference]: With dead ends: 49 [2019-09-05 12:03:59,648 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:03:59,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-05 12:03:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:03:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-05 12:03:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 12:03:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-05 12:03:59,653 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-05 12:03:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:59,653 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-05 12:03:59,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 12:03:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-05 12:03:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 12:03:59,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:59,654 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:59,655 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:59,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1092418203, now seen corresponding path program 16 times [2019-09-05 12:03:59,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:59,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:59,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:59,840 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-05 12:03:59,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:03:59,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:59,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:59,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 12:03:59,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:59,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:59,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-05 12:03:59,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:03:59,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:03:59,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:03:59,886 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-09-05 12:03:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:59,949 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-05 12:03:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:03:59,949 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-09-05 12:03:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:59,950 INFO L225 Difference]: With dead ends: 51 [2019-09-05 12:03:59,950 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 12:03:59,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:03:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 12:03:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-05 12:03:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 12:03:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-05 12:03:59,966 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-05 12:03:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:59,967 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-05 12:03:59,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:03:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-05 12:03:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 12:03:59,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:59,968 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:59,968 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1317733671, now seen corresponding path program 17 times [2019-09-05 12:03:59,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:59,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:00,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:00,213 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:00,229 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:00,246 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-05 12:04:00,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:00,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:04:00,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Stream Closed [2019-09-05 12:04:00,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:00,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-05 12:04:00,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 12:04:00,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 12:04:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:04:00,270 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2019-09-05 12:04:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:00,319 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-05 12:04:00,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 12:04:00,323 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-09-05 12:04:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:00,324 INFO L225 Difference]: With dead ends: 53 [2019-09-05 12:04:00,324 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 12:04:00,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:04:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 12:04:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-05 12:04:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 12:04:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-05 12:04:00,330 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-05 12:04:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:00,330 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-05 12:04:00,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 12:04:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-05 12:04:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 12:04:00,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:00,331 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:00,331 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:00,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1808655255, now seen corresponding path program 18 times [2019-09-05 12:04:00,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:00,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:00,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:00,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:00,526 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-05 12:04:00,535 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:00,554 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 12:04:00,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:00,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 12:04:00,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:00,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:00,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-05 12:04:00,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:04:00,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:04:00,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:04:00,573 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2019-09-05 12:04:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:00,637 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-05 12:04:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 12:04:00,638 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-09-05 12:04:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:00,638 INFO L225 Difference]: With dead ends: 55 [2019-09-05 12:04:00,639 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 12:04:00,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:04:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 12:04:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-05 12:04:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 12:04:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-05 12:04:00,644 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-05 12:04:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:00,644 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-05 12:04:00,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:04:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-05 12:04:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 12:04:00,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:00,645 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:00,645 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash -208694059, now seen corresponding path program 19 times [2019-09-05 12:04:00,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:00,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:00,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:00,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:00,848 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:00,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:00,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 12:04:00,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:00,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:00,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-05 12:04:00,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 12:04:00,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 12:04:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:04:00,899 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2019-09-05 12:04:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:00,966 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-05 12:04:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 12:04:00,967 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-05 12:04:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:00,968 INFO L225 Difference]: With dead ends: 57 [2019-09-05 12:04:00,968 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 12:04:00,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:04:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 12:04:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-05 12:04:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 12:04:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-05 12:04:00,973 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-05 12:04:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:00,974 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-05 12:04:00,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 12:04:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-05 12:04:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 12:04:00,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:00,975 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:00,975 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:00,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:00,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1851134317, now seen corresponding path program 20 times [2019-09-05 12:04:00,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:00,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:00,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:01,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:01,290 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) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:01,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:01,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:01,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 12:04:01,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:01,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:01,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-05 12:04:01,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 12:04:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 12:04:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:04:01,368 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2019-09-05 12:04:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:01,432 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-05 12:04:01,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 12:04:01,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-05 12:04:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:01,434 INFO L225 Difference]: With dead ends: 59 [2019-09-05 12:04:01,434 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 12:04:01,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:04:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 12:04:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-05 12:04:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 12:04:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-05 12:04:01,439 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-05 12:04:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:01,440 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-05 12:04:01,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 12:04:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-05 12:04:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 12:04:01,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:01,441 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:01,441 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:01,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash 311742673, now seen corresponding path program 21 times [2019-09-05 12:04:01,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:01,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:01,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:01,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:01,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 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-05 12:04:01,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:01,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-05 12:04:01,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:01,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:04:01,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:01,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:01,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-05 12:04:01,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:04:01,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:04:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 12:04:01,749 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2019-09-05 12:04:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:01,824 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-05 12:04:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 12:04:01,824 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2019-09-05 12:04:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:01,825 INFO L225 Difference]: With dead ends: 61 [2019-09-05 12:04:01,825 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 12:04:01,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 12:04:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 12:04:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-05 12:04:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 12:04:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-05 12:04:01,829 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-05 12:04:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:01,830 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-05 12:04:01,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:04:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-05 12:04:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 12:04:01,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:01,830 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:01,832 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash 72358799, now seen corresponding path program 22 times [2019-09-05 12:04:01,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:01,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:01,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:02,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:02,110 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) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:02,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:02,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:02,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 12:04:02,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:02,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:02,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-05 12:04:02,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 12:04:02,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 12:04:02,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:04:02,163 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-09-05 12:04:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:02,229 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-05 12:04:02,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 12:04:02,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-09-05 12:04:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:02,230 INFO L225 Difference]: With dead ends: 63 [2019-09-05 12:04:02,230 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 12:04:02,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:04:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 12:04:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-05 12:04:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 12:04:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-05 12:04:02,234 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-05 12:04:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:02,234 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-05 12:04:02,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 12:04:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-05 12:04:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:04:02,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:02,235 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:02,235 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:02,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1952689869, now seen corresponding path program 23 times [2019-09-05 12:04:02,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:02,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:02,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:02,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:02,535 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-05 12:04:02,545 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:02,576 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-05 12:04:02,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:02,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:04:02,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:02,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:02,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-05 12:04:02,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 12:04:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 12:04:02,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:04:02,594 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-09-05 12:04:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:02,660 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-05 12:04:02,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:04:02,660 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-05 12:04:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:02,661 INFO L225 Difference]: With dead ends: 65 [2019-09-05 12:04:02,661 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 12:04:02,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:04:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 12:04:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-05 12:04:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 12:04:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-05 12:04:02,665 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-05 12:04:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:02,665 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-05 12:04:02,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 12:04:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-05 12:04:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 12:04:02,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:02,666 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:02,666 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash 769616523, now seen corresponding path program 24 times [2019-09-05 12:04:02,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:02,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:02,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:02,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:03,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:03,104 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:03,113 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:03,138 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 12:04:03,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:03,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 12:04:03,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:03,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:03,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-05 12:04:03,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 12:04:03,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 12:04:03,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:04:03,156 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2019-09-05 12:04:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:03,231 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-05 12:04:03,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 12:04:03,234 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-09-05 12:04:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:03,235 INFO L225 Difference]: With dead ends: 67 [2019-09-05 12:04:03,235 INFO L226 Difference]: Without dead ends: 62 [2019-09-05 12:04:03,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:04:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-05 12:04:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-05 12:04:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-05 12:04:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-05 12:04:03,240 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-05 12:04:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:03,240 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-05 12:04:03,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 12:04:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-05 12:04:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 12:04:03,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:03,241 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:03,241 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2002464457, now seen corresponding path program 25 times [2019-09-05 12:04:03,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:03,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:03,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:03,652 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-05 12:04:03,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:03,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 12:04:03,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:03,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:03,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-05 12:04:03,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:04:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:04:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:04:03,695 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-09-05 12:04:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:03,762 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-05 12:04:03,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 12:04:03,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-09-05 12:04:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:03,764 INFO L225 Difference]: With dead ends: 69 [2019-09-05 12:04:03,764 INFO L226 Difference]: Without dead ends: 64 [2019-09-05 12:04:03,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:04:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-05 12:04:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-05 12:04:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 12:04:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-05 12:04:03,768 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-05 12:04:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:03,768 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-05 12:04:03,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:04:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-05 12:04:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 12:04:03,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:03,769 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:03,769 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1358355335, now seen corresponding path program 26 times [2019-09-05 12:04:03,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:03,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:03,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:04,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:04,118 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-05 12:04:04,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:04,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:04,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:04,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 12:04:04,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:04,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:04,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-05 12:04:04,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 12:04:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 12:04:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:04:04,164 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2019-09-05 12:04:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:04,268 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-05 12:04:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 12:04:04,269 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-09-05 12:04:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:04,269 INFO L225 Difference]: With dead ends: 71 [2019-09-05 12:04:04,269 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 12:04:04,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:04:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 12:04:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-05 12:04:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 12:04:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-05 12:04:04,274 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-05 12:04:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:04,275 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-05 12:04:04,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 12:04:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-05 12:04:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 12:04:04,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:04,276 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:04,276 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash 844779717, now seen corresponding path program 27 times [2019-09-05 12:04:04,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:04,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:04,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:04,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:04,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:04,667 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-05 12:04:04,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:04,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-05 12:04:04,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:04,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:04:04,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:04,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:04,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-05 12:04:04,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 12:04:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 12:04:04,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 12:04:04,735 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2019-09-05 12:04:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:04,848 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-05 12:04:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 12:04:04,849 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-05 12:04:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:04,850 INFO L225 Difference]: With dead ends: 73 [2019-09-05 12:04:04,850 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 12:04:04,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 12:04:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 12:04:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-05 12:04:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 12:04:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-05 12:04:04,855 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-05 12:04:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:04,855 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-05 12:04:04,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 12:04:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-05 12:04:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 12:04:04,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:04,856 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:04,860 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:04,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1219849859, now seen corresponding path program 28 times [2019-09-05 12:04:04,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:04,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:04,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:04,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:04,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:05,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:05,250 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-05 12:04:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:05,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:05,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:05,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:04:05,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:05,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:05,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-05 12:04:05,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 12:04:05,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 12:04:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:04:05,316 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2019-09-05 12:04:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:05,376 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-05 12:04:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:04:05,377 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-09-05 12:04:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:05,378 INFO L225 Difference]: With dead ends: 75 [2019-09-05 12:04:05,378 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 12:04:05,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:04:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 12:04:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-05 12:04:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 12:04:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-05 12:04:05,383 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-05 12:04:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:05,383 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-05 12:04:05,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 12:04:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-05 12:04:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 12:04:05,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:05,384 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:05,385 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash 885003457, now seen corresponding path program 29 times [2019-09-05 12:04:05,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:05,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:05,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:05,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:05,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 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-05 12:04:05,793 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:05,824 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-05 12:04:05,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:05,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:04:05,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:05,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:05,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-05 12:04:05,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 12:04:05,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 12:04:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:04:05,846 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2019-09-05 12:04:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:05,955 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-05 12:04:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 12:04:05,955 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-09-05 12:04:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:05,956 INFO L225 Difference]: With dead ends: 77 [2019-09-05 12:04:05,957 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 12:04:05,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:04:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 12:04:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-05 12:04:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 12:04:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-05 12:04:05,962 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-05 12:04:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:05,962 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-05 12:04:05,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 12:04:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-05 12:04:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 12:04:05,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:05,963 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:05,963 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1220158335, now seen corresponding path program 30 times [2019-09-05 12:04:05,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:05,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:05,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:06,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:06,466 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-05 12:04:06,482 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:06,515 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-05 12:04:06,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:06,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 12:04:06,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:06,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:06,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-05 12:04:06,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 12:04:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 12:04:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:04:06,534 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2019-09-05 12:04:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:06,622 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-05 12:04:06,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:04:06,623 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2019-09-05 12:04:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:06,624 INFO L225 Difference]: With dead ends: 79 [2019-09-05 12:04:06,624 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 12:04:06,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:04:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 12:04:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-05 12:04:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 12:04:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-05 12:04:06,628 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-05 12:04:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:06,628 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-05 12:04:06,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 12:04:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-05 12:04:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 12:04:06,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:06,629 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:06,630 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:06,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1181448893, now seen corresponding path program 31 times [2019-09-05 12:04:06,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:06,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:06,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:07,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:07,050 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:07,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:07,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 12:04:07,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:07,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:07,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-05 12:04:07,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:04:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:04:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:04:07,096 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2019-09-05 12:04:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:07,214 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-05 12:04:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 12:04:07,215 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-05 12:04:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:07,216 INFO L225 Difference]: With dead ends: 81 [2019-09-05 12:04:07,216 INFO L226 Difference]: Without dead ends: 76 [2019-09-05 12:04:07,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:04:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-05 12:04:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-05 12:04:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 12:04:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-05 12:04:07,219 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-05 12:04:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:07,220 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-05 12:04:07,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:04:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-05 12:04:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 12:04:07,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:07,221 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:07,221 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:07,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1658586501, now seen corresponding path program 32 times [2019-09-05 12:04:07,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:07,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:07,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:07,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:07,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:07,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:07,647 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-05 12:04:07,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:07,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:07,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:07,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 12:04:07,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:07,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:07,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-05 12:04:07,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 12:04:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 12:04:07,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:04:07,694 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2019-09-05 12:04:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:07,794 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-05 12:04:07,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 12:04:07,796 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-09-05 12:04:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:07,797 INFO L225 Difference]: With dead ends: 83 [2019-09-05 12:04:07,797 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 12:04:07,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:04:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 12:04:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-05 12:04:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 12:04:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-05 12:04:07,801 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-05 12:04:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:07,801 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-05 12:04:07,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 12:04:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-05 12:04:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 12:04:07,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:07,802 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:07,802 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:07,803 INFO L82 PathProgramCache]: Analyzing trace with hash 666600121, now seen corresponding path program 33 times [2019-09-05 12:04:07,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:07,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:07,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:07,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:07,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:08,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:08,543 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) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:08,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:08,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-05 12:04:08,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:08,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 12:04:08,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:08,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:08,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-05 12:04:08,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 12:04:08,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 12:04:08,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:04:08,626 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2019-09-05 12:04:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:08,720 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-05 12:04:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 12:04:08,721 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-09-05 12:04:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:08,722 INFO L225 Difference]: With dead ends: 85 [2019-09-05 12:04:08,722 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 12:04:08,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:04:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 12:04:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-05 12:04:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 12:04:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-05 12:04:08,727 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-05 12:04:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:08,727 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-05 12:04:08,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 12:04:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-05 12:04:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:04:08,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:08,728 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:08,728 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1787949943, now seen corresponding path program 34 times [2019-09-05 12:04:08,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:08,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:09,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:09,212 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) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:09,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:09,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:09,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:09,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 12:04:09,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:09,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:09,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-05 12:04:09,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 12:04:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 12:04:09,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:04:09,260 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2019-09-05 12:04:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:09,372 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-05 12:04:09,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:04:09,373 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-09-05 12:04:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:09,374 INFO L225 Difference]: With dead ends: 87 [2019-09-05 12:04:09,374 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 12:04:09,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:04:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 12:04:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-05 12:04:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-05 12:04:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-05 12:04:09,379 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-05 12:04:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:09,379 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-05 12:04:09,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 12:04:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-05 12:04:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 12:04:09,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:09,380 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:09,380 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:09,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1368337589, now seen corresponding path program 35 times [2019-09-05 12:04:09,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:09,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:09,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:09,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:10,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:10,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:10,098 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:10,134 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-05 12:04:10,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:10,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 12:04:10,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:10,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:10,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-05 12:04:10,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 12:04:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 12:04:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:04:10,156 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2019-09-05 12:04:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:10,254 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-09-05 12:04:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 12:04:10,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-05 12:04:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:10,256 INFO L225 Difference]: With dead ends: 89 [2019-09-05 12:04:10,256 INFO L226 Difference]: Without dead ends: 84 [2019-09-05 12:04:10,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:04:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-05 12:04:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-05 12:04:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-05 12:04:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-05 12:04:10,260 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-05 12:04:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:10,261 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-05 12:04:10,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 12:04:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-05 12:04:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-05 12:04:10,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:10,262 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:10,262 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1847791219, now seen corresponding path program 36 times [2019-09-05 12:04:10,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:10,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:10,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:10,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:10,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:10,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:10,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:10,845 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:10,886 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-05 12:04:10,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:10,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 12:04:10,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:10,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:10,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-05 12:04:10,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 12:04:10,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 12:04:10,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:04:10,910 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2019-09-05 12:04:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:11,023 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-09-05 12:04:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 12:04:11,024 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2019-09-05 12:04:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:11,025 INFO L225 Difference]: With dead ends: 91 [2019-09-05 12:04:11,025 INFO L226 Difference]: Without dead ends: 86 [2019-09-05 12:04:11,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:04:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-05 12:04:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-05 12:04:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-05 12:04:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-05 12:04:11,028 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-05 12:04:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:11,029 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-05 12:04:11,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 12:04:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-05 12:04:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-05 12:04:11,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:11,030 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:11,030 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1253738319, now seen corresponding path program 37 times [2019-09-05 12:04:11,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:11,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:11,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:11,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:11,935 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-05 12:04:11,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:11,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 12:04:11,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:12,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:12,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-05 12:04:12,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 12:04:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 12:04:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:04:12,023 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2019-09-05 12:04:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:12,143 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-09-05 12:04:12,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 12:04:12,144 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-09-05 12:04:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:12,145 INFO L225 Difference]: With dead ends: 93 [2019-09-05 12:04:12,145 INFO L226 Difference]: Without dead ends: 88 [2019-09-05 12:04:12,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:04:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-05 12:04:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-05 12:04:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-05 12:04:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-05 12:04:12,151 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-05 12:04:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:12,152 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-05 12:04:12,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 12:04:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-05 12:04:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 12:04:12,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:12,153 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:12,154 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1116320913, now seen corresponding path program 38 times [2019-09-05 12:04:12,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:12,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:12,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:12,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:12,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:12,803 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-05 12:04:12,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:12,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:12,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:12,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 12:04:12,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:12,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:12,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-05 12:04:12,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 12:04:12,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 12:04:12,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:04:12,851 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2019-09-05 12:04:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:12,977 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-09-05 12:04:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 12:04:12,977 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-09-05 12:04:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:12,978 INFO L225 Difference]: With dead ends: 95 [2019-09-05 12:04:12,978 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 12:04:12,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:04:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 12:04:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-05 12:04:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-05 12:04:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-05 12:04:12,983 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-05 12:04:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:12,983 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-05 12:04:12,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 12:04:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-05 12:04:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-05 12:04:12,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:12,984 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:12,984 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2092787373, now seen corresponding path program 39 times [2019-09-05 12:04:12,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:12,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:12,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:12,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:12,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:13,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:13,640 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) [2019-09-05 12:04:13,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:13,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-05 12:04:13,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:13,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 12:04:13,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:13,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:13,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-05 12:04:13,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 12:04:13,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 12:04:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 12:04:13,727 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2019-09-05 12:04:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:13,862 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-09-05 12:04:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 12:04:13,862 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-05 12:04:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:13,864 INFO L225 Difference]: With dead ends: 97 [2019-09-05 12:04:13,864 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 12:04:13,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 12:04:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 12:04:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-05 12:04:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 12:04:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-05 12:04:13,867 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-05 12:04:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:13,868 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-05 12:04:13,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 12:04:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-05 12:04:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-05 12:04:13,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:13,869 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:13,869 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2035635605, now seen corresponding path program 40 times [2019-09-05 12:04:13,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:13,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:13,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:13,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:13,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:14,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:14,574 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-05 12:04:14,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:14,602 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:14,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:14,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 12:04:14,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:14,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:14,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-05 12:04:14,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 12:04:14,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 12:04:14,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:04:14,625 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2019-09-05 12:04:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:14,774 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-09-05 12:04:14,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 12:04:14,775 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2019-09-05 12:04:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:14,776 INFO L225 Difference]: With dead ends: 99 [2019-09-05 12:04:14,776 INFO L226 Difference]: Without dead ends: 94 [2019-09-05 12:04:14,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:04:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-05 12:04:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-05 12:04:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-05 12:04:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-05 12:04:14,782 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-05 12:04:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:14,782 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-05 12:04:14,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 12:04:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-05 12:04:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-05 12:04:14,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:14,783 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:14,783 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash -900335959, now seen corresponding path program 41 times [2019-09-05 12:04:14,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:14,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:14,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:14,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:14,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:15,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:15,479 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-05 12:04:15,489 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:15,531 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-05 12:04:15,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:15,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 12:04:15,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 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-05 12:04:15,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:15,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-05 12:04:15,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 12:04:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 12:04:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:04:15,554 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2019-09-05 12:04:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:15,705 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-09-05 12:04:15,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 12:04:15,706 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-09-05 12:04:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:15,707 INFO L225 Difference]: With dead ends: 101 [2019-09-05 12:04:15,707 INFO L226 Difference]: Without dead ends: 96 [2019-09-05 12:04:15,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:04:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-05 12:04:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-05 12:04:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 12:04:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-05 12:04:15,713 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-05 12:04:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:15,714 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-05 12:04:15,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 12:04:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-05 12:04:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 12:04:15,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:15,715 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:15,716 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:15,717 INFO L82 PathProgramCache]: Analyzing trace with hash -799069337, now seen corresponding path program 42 times [2019-09-05 12:04:15,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:15,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:15,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:16,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:16,462 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) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:16,473 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:16,520 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-05 12:04:16,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:16,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 12:04:16,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:16,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:16,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-05 12:04:16,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 12:04:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 12:04:16,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:04:16,546 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2019-09-05 12:04:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:16,697 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-09-05 12:04:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 12:04:16,698 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2019-09-05 12:04:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:16,699 INFO L225 Difference]: With dead ends: 103 [2019-09-05 12:04:16,699 INFO L226 Difference]: Without dead ends: 98 [2019-09-05 12:04:16,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:04:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-05 12:04:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-05 12:04:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-05 12:04:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-05 12:04:16,704 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-05 12:04:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:16,704 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-05 12:04:16,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 12:04:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-05 12:04:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-05 12:04:16,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:16,705 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:16,706 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2028873893, now seen corresponding path program 43 times [2019-09-05 12:04:16,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:16,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:16,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:16,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:16,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:17,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:17,572 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-05 12:04:17,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:17,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:04:17,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:17,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:17,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-05 12:04:17,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 12:04:17,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 12:04:17,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:04:17,628 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2019-09-05 12:04:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:17,743 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-09-05 12:04:17,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 12:04:17,743 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-05 12:04:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:17,745 INFO L225 Difference]: With dead ends: 105 [2019-09-05 12:04:17,745 INFO L226 Difference]: Without dead ends: 100 [2019-09-05 12:04:17,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:04:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-05 12:04:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-05 12:04:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-05 12:04:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-05 12:04:17,749 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-05 12:04:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:17,749 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-05 12:04:17,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 12:04:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-05 12:04:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-05 12:04:17,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:17,750 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:17,750 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash 968019555, now seen corresponding path program 44 times [2019-09-05 12:04:17,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:17,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:17,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:18,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:18,547 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-05 12:04:18,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:18,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:18,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:18,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 12:04:18,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:18,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:18,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-05 12:04:18,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 12:04:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 12:04:18,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:04:18,604 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2019-09-05 12:04:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:18,754 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-09-05 12:04:18,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 12:04:18,759 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2019-09-05 12:04:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:18,760 INFO L225 Difference]: With dead ends: 107 [2019-09-05 12:04:18,760 INFO L226 Difference]: Without dead ends: 102 [2019-09-05 12:04:18,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:04:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-05 12:04:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-05 12:04:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-05 12:04:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-05 12:04:18,764 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-05 12:04:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:18,765 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-05 12:04:18,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 12:04:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-05 12:04:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-05 12:04:18,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:18,766 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:18,766 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash -605750111, now seen corresponding path program 45 times [2019-09-05 12:04:18,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:18,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:18,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:18,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:18,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:19,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:19,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 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-05 12:04:19,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:19,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-05 12:04:19,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:19,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 12:04:19,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:19,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:19,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-05 12:04:19,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 12:04:19,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 12:04:19,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:04:19,767 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2019-09-05 12:04:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:19,910 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-09-05 12:04:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 12:04:19,911 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2019-09-05 12:04:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:19,912 INFO L225 Difference]: With dead ends: 109 [2019-09-05 12:04:19,912 INFO L226 Difference]: Without dead ends: 104 [2019-09-05 12:04:19,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:04:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-05 12:04:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-05 12:04:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-05 12:04:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-05 12:04:19,915 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-05 12:04:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:19,916 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-05 12:04:19,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 12:04:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-05 12:04:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 12:04:19,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:19,917 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:19,917 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1169910945, now seen corresponding path program 46 times [2019-09-05 12:04:19,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:19,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:19,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:20,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:20,807 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-05 12:04:20,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:20,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:20,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:20,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 12:04:20,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:20,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:20,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-05 12:04:20,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 12:04:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 12:04:20,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:04:20,857 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2019-09-05 12:04:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:21,013 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-09-05 12:04:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 12:04:21,013 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2019-09-05 12:04:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:21,015 INFO L225 Difference]: With dead ends: 111 [2019-09-05 12:04:21,015 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 12:04:21,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:04:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 12:04:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-05 12:04:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-05 12:04:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-05 12:04:21,019 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-05 12:04:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:21,019 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-05 12:04:21,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 12:04:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-05 12:04:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-05 12:04:21,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:21,021 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:21,021 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:21,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:21,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2132374173, now seen corresponding path program 47 times [2019-09-05 12:04:21,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:21,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:21,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:21,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:21,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:21,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:21,910 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) [2019-09-05 12:04:21,930 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:21,976 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-05 12:04:21,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:21,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 12:04:21,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:22,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:22,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-05 12:04:22,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 12:04:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 12:04:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:04:22,003 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2019-09-05 12:04:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:22,169 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-09-05 12:04:22,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 12:04:22,171 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-05 12:04:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:22,172 INFO L225 Difference]: With dead ends: 113 [2019-09-05 12:04:22,173 INFO L226 Difference]: Without dead ends: 108 [2019-09-05 12:04:22,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:04:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-05 12:04:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-05 12:04:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-05 12:04:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-05 12:04:22,177 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-05 12:04:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:22,178 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-05 12:04:22,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 12:04:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-05 12:04:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 12:04:22,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:22,179 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:22,179 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:22,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:22,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1647540827, now seen corresponding path program 48 times [2019-09-05 12:04:22,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:22,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:22,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:22,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:23,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:23,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 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-05 12:04:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:23,155 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-05 12:04:23,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:23,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 12:04:23,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:23,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:23,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-05 12:04:23,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 12:04:23,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 12:04:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:04:23,180 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2019-09-05 12:04:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:23,349 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-09-05 12:04:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 12:04:23,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-09-05 12:04:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:23,353 INFO L225 Difference]: With dead ends: 115 [2019-09-05 12:04:23,353 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 12:04:23,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:04:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 12:04:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-05 12:04:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-05 12:04:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-05 12:04:23,357 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-05 12:04:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:23,358 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-05 12:04:23,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 12:04:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-05 12:04:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-05 12:04:23,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:23,359 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:23,359 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash -420836711, now seen corresponding path program 49 times [2019-09-05 12:04:23,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:23,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:23,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:23,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:23,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:24,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:24,333 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-05 12:04:24,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:24,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 12:04:24,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:24,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:24,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-05 12:04:24,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 12:04:24,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 12:04:24,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:04:24,383 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2019-09-05 12:04:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:24,543 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-09-05 12:04:24,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 12:04:24,543 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2019-09-05 12:04:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:24,544 INFO L225 Difference]: With dead ends: 117 [2019-09-05 12:04:24,545 INFO L226 Difference]: Without dead ends: 112 [2019-09-05 12:04:24,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:04:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-05 12:04:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-05 12:04:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-05 12:04:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-05 12:04:24,550 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-05 12:04:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:24,550 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-05 12:04:24,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 12:04:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-05 12:04:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 12:04:24,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:24,553 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:24,553 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash 438207319, now seen corresponding path program 50 times [2019-09-05 12:04:24,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:24,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:24,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:25,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:25,554 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-05 12:04:25,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:25,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:25,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:25,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 12:04:25,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:25,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:25,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-05 12:04:25,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 12:04:25,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 12:04:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:04:25,610 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2019-09-05 12:04:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:25,784 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-09-05 12:04:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 12:04:25,786 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2019-09-05 12:04:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:25,787 INFO L225 Difference]: With dead ends: 119 [2019-09-05 12:04:25,787 INFO L226 Difference]: Without dead ends: 114 [2019-09-05 12:04:25,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:04:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-05 12:04:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-05 12:04:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-05 12:04:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-05 12:04:25,792 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-05 12:04:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:25,792 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-05 12:04:25,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 12:04:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-05 12:04:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-05 12:04:25,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:25,793 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:25,793 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1345799317, now seen corresponding path program 51 times [2019-09-05 12:04:25,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:25,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:25,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:26,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:26,985 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-05 12:04:26,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:27,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-05 12:04:27,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:27,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 12:04:27,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:27,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:27,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-05 12:04:27,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-05 12:04:27,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-05 12:04:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 12:04:27,099 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2019-09-05 12:04:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:27,256 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-09-05 12:04:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 12:04:27,257 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-05 12:04:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:27,258 INFO L225 Difference]: With dead ends: 121 [2019-09-05 12:04:27,258 INFO L226 Difference]: Without dead ends: 116 [2019-09-05 12:04:27,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 12:04:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-05 12:04:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-05 12:04:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-05 12:04:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-05 12:04:27,263 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-05 12:04:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:27,264 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-05 12:04:27,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-05 12:04:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-05 12:04:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-05 12:04:27,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:27,265 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:27,265 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1663348307, now seen corresponding path program 52 times [2019-09-05 12:04:27,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:27,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:27,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:27,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:28,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:28,411 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) [2019-09-05 12:04:28,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:28,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:28,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:28,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 12:04:28,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:28,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:28,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-05 12:04:28,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 12:04:28,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 12:04:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:04:28,484 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2019-09-05 12:04:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:28,616 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-09-05 12:04:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 12:04:28,616 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-09-05 12:04:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:28,617 INFO L225 Difference]: With dead ends: 123 [2019-09-05 12:04:28,617 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 12:04:28,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:04:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 12:04:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-05 12:04:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-05 12:04:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-05 12:04:28,623 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-05 12:04:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:28,624 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-05 12:04:28,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 12:04:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-05 12:04:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-05 12:04:28,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:28,625 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:28,625 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1885249681, now seen corresponding path program 53 times [2019-09-05 12:04:28,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:28,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:28,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:28,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:28,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:29,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:29,704 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) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:29,715 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:29,778 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-05 12:04:29,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:29,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 12:04:29,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (54)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:29,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:29,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-05 12:04:29,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 12:04:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 12:04:29,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:04:29,812 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2019-09-05 12:04:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:29,981 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-09-05 12:04:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-05 12:04:29,981 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-09-05 12:04:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:29,982 INFO L225 Difference]: With dead ends: 125 [2019-09-05 12:04:29,982 INFO L226 Difference]: Without dead ends: 120 [2019-09-05 12:04:29,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:04:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-05 12:04:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-05 12:04:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-05 12:04:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-05 12:04:29,986 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-05 12:04:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:29,987 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-05 12:04:29,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 12:04:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-05 12:04:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-05 12:04:29,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:29,988 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:29,988 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash 384105295, now seen corresponding path program 54 times [2019-09-05 12:04:29,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:29,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:29,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:29,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:29,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:31,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:31,151 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-05 12:04:31,162 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:31,226 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-05 12:04:31,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:31,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 12:04:31,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:31,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:31,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-05 12:04:31,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 12:04:31,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 12:04:31,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:04:31,257 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2019-09-05 12:04:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:31,456 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-09-05 12:04:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:04:31,457 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-05 12:04:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:31,458 INFO L225 Difference]: With dead ends: 127 [2019-09-05 12:04:31,458 INFO L226 Difference]: Without dead ends: 122 [2019-09-05 12:04:31,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:04:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-05 12:04:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-05 12:04:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-05 12:04:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-05 12:04:31,462 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-05 12:04:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:31,462 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-05 12:04:31,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 12:04:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-05 12:04:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-05 12:04:31,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:31,463 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:31,463 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash 893361805, now seen corresponding path program 55 times [2019-09-05 12:04:31,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:31,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:31,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:31,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:32,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:32,828 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) [2019-09-05 12:04:32,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:32,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 12:04:32,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:32,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:32,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-05 12:04:32,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-05 12:04:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-05 12:04:32,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:04:32,899 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2019-09-05 12:04:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:33,033 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-09-05 12:04:33,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-05 12:04:33,034 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-05 12:04:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:33,035 INFO L225 Difference]: With dead ends: 129 [2019-09-05 12:04:33,035 INFO L226 Difference]: Without dead ends: 124 [2019-09-05 12:04:33,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:04:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-05 12:04:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-05 12:04:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-05 12:04:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-05 12:04:33,039 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-05 12:04:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:33,040 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-05 12:04:33,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-05 12:04:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-05 12:04:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-05 12:04:33,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:33,041 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:33,041 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash 662596171, now seen corresponding path program 56 times [2019-09-05 12:04:33,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:33,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:33,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:34,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:34,232 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-05 12:04:34,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:34,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:34,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:34,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 12:04:34,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (57)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:34,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:34,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-05 12:04:34,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 12:04:34,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 12:04:34,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:04:34,299 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2019-09-05 12:04:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:34,435 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-09-05 12:04:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 12:04:34,436 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2019-09-05 12:04:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:34,437 INFO L225 Difference]: With dead ends: 131 [2019-09-05 12:04:34,437 INFO L226 Difference]: Without dead ends: 126 [2019-09-05 12:04:34,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:04:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-05 12:04:34,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-05 12:04:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-05 12:04:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-05 12:04:34,442 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-05 12:04:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:34,442 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-05 12:04:34,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 12:04:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-05 12:04:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-05 12:04:34,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:34,443 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:34,444 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2059846007, now seen corresponding path program 57 times [2019-09-05 12:04:34,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:34,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:34,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:34,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:34,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:36,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:36,234 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-05 12:04:36,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:36,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-05 12:04:36,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:36,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 12:04:36,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-05 12:04:36,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-05 12:04:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-05 12:04:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:04:36,338 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2019-09-05 12:04:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:36,539 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-09-05 12:04:36,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-05 12:04:36,539 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2019-09-05 12:04:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:36,541 INFO L225 Difference]: With dead ends: 133 [2019-09-05 12:04:36,541 INFO L226 Difference]: Without dead ends: 128 [2019-09-05 12:04:36,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:04:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-05 12:04:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-05 12:04:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-05 12:04:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-05 12:04:36,545 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-05 12:04:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:36,545 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-05 12:04:36,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-05 12:04:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-05 12:04:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-05 12:04:36,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:36,546 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:36,546 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:36,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1603271495, now seen corresponding path program 58 times [2019-09-05 12:04:36,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:36,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:36,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:37,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:37,805 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-05 12:04:37,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:37,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:37,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:37,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 12:04:37,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:37,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:37,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-05 12:04:37,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-05 12:04:37,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-05 12:04:37,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:04:37,884 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2019-09-05 12:04:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:38,057 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-09-05 12:04:38,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-05 12:04:38,058 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2019-09-05 12:04:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:38,059 INFO L225 Difference]: With dead ends: 135 [2019-09-05 12:04:38,059 INFO L226 Difference]: Without dead ends: 130 [2019-09-05 12:04:38,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:04:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-05 12:04:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-05 12:04:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-05 12:04:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-09-05 12:04:38,063 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-09-05 12:04:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:38,064 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-09-05 12:04:38,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-05 12:04:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-09-05 12:04:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-05 12:04:38,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:38,065 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:38,065 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:38,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:38,065 INFO L82 PathProgramCache]: Analyzing trace with hash -13991803, now seen corresponding path program 59 times [2019-09-05 12:04:38,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:38,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:38,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:38,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:38,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:39,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:39,422 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-05 12:04:39,432 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:39,500 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-05 12:04:39,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:39,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 12:04:39,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:39,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:39,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-05 12:04:39,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-05 12:04:39,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-05 12:04:39,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 12:04:39,533 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2019-09-05 12:04:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:39,766 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-09-05 12:04:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-05 12:04:39,766 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2019-09-05 12:04:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:39,768 INFO L225 Difference]: With dead ends: 137 [2019-09-05 12:04:39,768 INFO L226 Difference]: Without dead ends: 132 [2019-09-05 12:04:39,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 12:04:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-05 12:04:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-05 12:04:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-05 12:04:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-09-05 12:04:39,771 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-09-05 12:04:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:39,771 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-09-05 12:04:39,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-05 12:04:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-09-05 12:04:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-05 12:04:39,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:39,772 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:39,773 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash 574139971, now seen corresponding path program 60 times [2019-09-05 12:04:39,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:39,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:39,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:39,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:39,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:41,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:41,183 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-05 12:04:41,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:41,266 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-05 12:04:41,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:41,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 12:04:41,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:41,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:41,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-05 12:04:41,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 12:04:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 12:04:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:04:41,299 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2019-09-05 12:04:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:41,484 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-09-05 12:04:41,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 12:04:41,485 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2019-09-05 12:04:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:41,486 INFO L225 Difference]: With dead ends: 139 [2019-09-05 12:04:41,486 INFO L226 Difference]: Without dead ends: 134 [2019-09-05 12:04:41,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:04:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-05 12:04:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-05 12:04:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-05 12:04:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-05 12:04:41,490 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-09-05 12:04:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:41,490 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-05 12:04:41,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 12:04:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-05 12:04:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-05 12:04:41,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:41,491 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:41,492 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1166908287, now seen corresponding path program 61 times [2019-09-05 12:04:41,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:41,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:41,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:43,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:43,948 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-05 12:04:43,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:44,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 12:04:44,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:44,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:44,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-05 12:04:44,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-05 12:04:44,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-05 12:04:44,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 12:04:44,079 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2019-09-05 12:04:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:44,398 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-09-05 12:04:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 12:04:44,399 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2019-09-05 12:04:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:44,400 INFO L225 Difference]: With dead ends: 141 [2019-09-05 12:04:44,400 INFO L226 Difference]: Without dead ends: 136 [2019-09-05 12:04:44,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 12:04:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-05 12:04:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-05 12:04:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-05 12:04:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-09-05 12:04:44,412 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-09-05 12:04:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:44,413 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-09-05 12:04:44,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-05 12:04:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-09-05 12:04:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-05 12:04:44,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:44,416 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:44,416 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash 722961215, now seen corresponding path program 62 times [2019-09-05 12:04:44,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:44,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:44,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:44,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:44,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:45,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:45,984 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-05 12:04:45,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:46,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:46,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:46,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-05 12:04:46,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (63)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:04:46,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:46,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-05 12:04:46,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 12:04:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 12:04:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:04:46,056 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2019-09-05 12:04:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:46,266 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-09-05 12:04:46,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 12:04:46,267 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2019-09-05 12:04:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:46,268 INFO L225 Difference]: With dead ends: 143 [2019-09-05 12:04:46,268 INFO L226 Difference]: Without dead ends: 138 [2019-09-05 12:04:46,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:04:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-05 12:04:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-05 12:04:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-05 12:04:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-09-05 12:04:46,272 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-09-05 12:04:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:46,273 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-09-05 12:04:46,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 12:04:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-09-05 12:04:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-05 12:04:46,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:46,274 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:46,274 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:46,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash 116386429, now seen corresponding path program 63 times [2019-09-05 12:04:46,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:46,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:46,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:47,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:47,759 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-05 12:04:47,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:47,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-05 12:04:47,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:47,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 12:04:47,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:47,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:47,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-05 12:04:47,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-05 12:04:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-05 12:04:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:04:47,887 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2019-09-05 12:04:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:48,122 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-09-05 12:04:48,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-05 12:04:48,124 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2019-09-05 12:04:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:48,125 INFO L225 Difference]: With dead ends: 145 [2019-09-05 12:04:48,125 INFO L226 Difference]: Without dead ends: 140 [2019-09-05 12:04:48,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:04:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-05 12:04:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-05 12:04:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-05 12:04:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-05 12:04:48,129 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-09-05 12:04:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:48,129 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-05 12:04:48,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-05 12:04:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-05 12:04:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-05 12:04:48,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:48,131 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:48,131 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:48,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:48,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1313569339, now seen corresponding path program 64 times [2019-09-05 12:04:48,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:48,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:48,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:49,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:49,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 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-05 12:04:49,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:49,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:49,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:49,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-05 12:04:49,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:49,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:49,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-05 12:04:49,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-05 12:04:49,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-05 12:04:49,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:04:49,711 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2019-09-05 12:04:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:49,953 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-05 12:04:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-05 12:04:49,954 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2019-09-05 12:04:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:49,955 INFO L225 Difference]: With dead ends: 147 [2019-09-05 12:04:49,956 INFO L226 Difference]: Without dead ends: 142 [2019-09-05 12:04:49,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:04:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-05 12:04:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-05 12:04:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-05 12:04:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-09-05 12:04:49,962 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-09-05 12:04:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:49,962 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-09-05 12:04:49,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-05 12:04:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-09-05 12:04:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-05 12:04:49,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:49,965 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:49,965 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash 755110521, now seen corresponding path program 65 times [2019-09-05 12:04:49,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:49,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:49,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:51,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:51,682 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-05 12:04:51,693 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:51,773 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-09-05 12:04:51,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:51,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-05 12:04:51,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:51,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:51,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-05 12:04:51,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-05 12:04:51,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-05 12:04:51,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:04:51,813 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2019-09-05 12:04:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:52,043 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-05 12:04:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-05 12:04:52,044 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2019-09-05 12:04:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:52,044 INFO L225 Difference]: With dead ends: 149 [2019-09-05 12:04:52,044 INFO L226 Difference]: Without dead ends: 144 [2019-09-05 12:04:52,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:04:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-05 12:04:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-05 12:04:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-05 12:04:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-09-05 12:04:52,048 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-09-05 12:04:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:52,048 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-09-05 12:04:52,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-05 12:04:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-09-05 12:04:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-05 12:04:52,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:52,050 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:52,050 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash 947098423, now seen corresponding path program 66 times [2019-09-05 12:04:52,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:52,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:52,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:52,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:52,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:53,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:53,869 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-05 12:04:53,883 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:53,966 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-05 12:04:53,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:53,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 12:04:53,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:54,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-05 12:04:54,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-05 12:04:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-05 12:04:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:04:54,003 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2019-09-05 12:04:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:54,261 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-05 12:04:54,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-05 12:04:54,262 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2019-09-05 12:04:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:54,263 INFO L225 Difference]: With dead ends: 151 [2019-09-05 12:04:54,263 INFO L226 Difference]: Without dead ends: 146 [2019-09-05 12:04:54,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:04:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-05 12:04:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-05 12:04:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-05 12:04:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-09-05 12:04:54,268 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-09-05 12:04:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:54,269 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-09-05 12:04:54,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-05 12:04:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-09-05 12:04:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-05 12:04:54,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:54,269 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:54,270 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:54,270 INFO L82 PathProgramCache]: Analyzing trace with hash 763878517, now seen corresponding path program 67 times [2019-09-05 12:04:54,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:54,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:57,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:57,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:57,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:57,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 12:04:57,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:57,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:57,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-05 12:04:57,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-05 12:04:57,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-05 12:04:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 12:04:57,636 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 70 states. [2019-09-05 12:04:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:57,862 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-05 12:04:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-05 12:04:57,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2019-09-05 12:04:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:57,864 INFO L225 Difference]: With dead ends: 153 [2019-09-05 12:04:57,864 INFO L226 Difference]: Without dead ends: 148 [2019-09-05 12:04:57,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 12:04:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-05 12:04:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-09-05 12:04:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-05 12:04:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-09-05 12:04:57,868 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-09-05 12:04:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:57,869 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-09-05 12:04:57,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-05 12:04:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-09-05 12:04:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-05 12:04:57,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:57,870 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:57,870 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:57,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash 783207987, now seen corresponding path program 68 times [2019-09-05 12:04:57,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:57,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:57,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:57,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:59,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:59,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:00,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:00,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:00,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:00,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-05 12:05:00,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:00,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:00,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-05 12:05:00,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-05 12:05:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-05 12:05:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:05:00,072 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2019-09-05 12:05:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:00,340 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-05 12:05:00,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 12:05:00,340 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2019-09-05 12:05:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:00,341 INFO L225 Difference]: With dead ends: 155 [2019-09-05 12:05:00,342 INFO L226 Difference]: Without dead ends: 150 [2019-09-05 12:05:00,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:05:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-05 12:05:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-05 12:05:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-05 12:05:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-09-05 12:05:00,345 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-09-05 12:05:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:00,346 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-09-05 12:05:00,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-05 12:05:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-09-05 12:05:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-05 12:05:00,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:00,347 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:00,347 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:00,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2116007823, now seen corresponding path program 69 times [2019-09-05 12:05:00,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:00,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:00,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:00,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:00,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:02,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:02,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:02,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:02,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-05 12:05:02,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:02,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 12:05:02,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:02,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:02,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-05 12:05:02,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-05 12:05:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-05 12:05:02,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 12:05:02,523 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 72 states. [2019-09-05 12:05:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:02,718 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-05 12:05:02,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-05 12:05:02,718 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2019-09-05 12:05:02,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:02,719 INFO L225 Difference]: With dead ends: 157 [2019-09-05 12:05:02,719 INFO L226 Difference]: Without dead ends: 152 [2019-09-05 12:05:02,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 12:05:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-05 12:05:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-05 12:05:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-05 12:05:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-09-05 12:05:02,724 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-09-05 12:05:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:02,725 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-09-05 12:05:02,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-05 12:05:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-09-05 12:05:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-05 12:05:02,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:02,726 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:02,726 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash -828626129, now seen corresponding path program 70 times [2019-09-05 12:05:02,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:02,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:02,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:04,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:04,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:04,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:04,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:04,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:04,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-05 12:05:04,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:04,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:04,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-05 12:05:04,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-05 12:05:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-05 12:05:04,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 12:05:04,607 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2019-09-05 12:05:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:04,833 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-05 12:05:04,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 12:05:04,833 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2019-09-05 12:05:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:04,836 INFO L225 Difference]: With dead ends: 159 [2019-09-05 12:05:04,837 INFO L226 Difference]: Without dead ends: 154 [2019-09-05 12:05:04,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 12:05:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-05 12:05:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-05 12:05:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-05 12:05:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-09-05 12:05:04,841 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-09-05 12:05:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:04,842 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-09-05 12:05:04,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-05 12:05:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-09-05 12:05:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-05 12:05:04,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:04,843 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:04,843 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash -605399443, now seen corresponding path program 71 times [2019-09-05 12:05:04,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:04,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:04,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:04,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:06,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:06,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:06,676 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:06,769 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-05 12:05:06,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:06,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-05 12:05:06,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:06,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:06,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-05 12:05:06,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-05 12:05:06,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-05 12:05:06,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 12:05:06,807 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 74 states. [2019-09-05 12:05:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:07,105 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-05 12:05:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-05 12:05:07,105 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-05 12:05:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:07,106 INFO L225 Difference]: With dead ends: 161 [2019-09-05 12:05:07,106 INFO L226 Difference]: Without dead ends: 156 [2019-09-05 12:05:07,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 12:05:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-05 12:05:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-05 12:05:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-05 12:05:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-09-05 12:05:07,112 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-09-05 12:05:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:07,113 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-09-05 12:05:07,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-05 12:05:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-09-05 12:05:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-05 12:05:07,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:07,115 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:07,115 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash -832918997, now seen corresponding path program 72 times [2019-09-05 12:05:07,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:07,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:07,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:07,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:07,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:09,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:09,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:09,369 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-05 12:05:09,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:09,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 12:05:09,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:09,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:09,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-05 12:05:09,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-05 12:05:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-05 12:05:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 12:05:09,400 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2019-09-05 12:05:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:09,686 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-05 12:05:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 12:05:09,686 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2019-09-05 12:05:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:09,687 INFO L225 Difference]: With dead ends: 163 [2019-09-05 12:05:09,687 INFO L226 Difference]: Without dead ends: 158 [2019-09-05 12:05:09,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 12:05:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-05 12:05:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-05 12:05:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-05 12:05:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-09-05 12:05:09,693 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-09-05 12:05:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:09,694 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-09-05 12:05:09,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-05 12:05:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-09-05 12:05:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-05 12:05:09,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:09,695 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:09,695 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash -435878295, now seen corresponding path program 73 times [2019-09-05 12:05:09,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:09,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:09,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:09,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:09,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:11,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:11,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:11,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:11,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-05 12:05:11,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:11,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-05 12:05:11,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-05 12:05:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-05 12:05:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:05:11,716 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 76 states. [2019-09-05 12:05:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:11,999 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-05 12:05:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 12:05:11,999 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2019-09-05 12:05:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:12,000 INFO L225 Difference]: With dead ends: 165 [2019-09-05 12:05:12,000 INFO L226 Difference]: Without dead ends: 160 [2019-09-05 12:05:12,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:05:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-05 12:05:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-05 12:05:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-05 12:05:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-09-05 12:05:12,004 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-09-05 12:05:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:12,004 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-09-05 12:05:12,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-05 12:05:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-09-05 12:05:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-05 12:05:12,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:12,005 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:12,005 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:12,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1131853017, now seen corresponding path program 74 times [2019-09-05 12:05:12,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:12,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:12,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:12,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:13,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:13,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:13,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:13,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:13,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:13,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-05 12:05:13,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:14,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:14,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-05 12:05:14,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 12:05:14,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 12:05:14,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:05:14,010 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2019-09-05 12:05:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:14,299 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-05 12:05:14,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 12:05:14,300 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2019-09-05 12:05:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:14,304 INFO L225 Difference]: With dead ends: 167 [2019-09-05 12:05:14,304 INFO L226 Difference]: Without dead ends: 162 [2019-09-05 12:05:14,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:05:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-05 12:05:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-05 12:05:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-05 12:05:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-09-05 12:05:14,309 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-09-05 12:05:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:14,309 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-09-05 12:05:14,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 12:05:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-09-05 12:05:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-05 12:05:14,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:14,310 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:14,310 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 51337317, now seen corresponding path program 75 times [2019-09-05 12:05:14,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:14,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:14,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:16,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:16,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:16,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:16,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-09-05 12:05:16,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:16,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 12:05:16,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:16,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:16,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-05 12:05:16,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-05 12:05:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-05 12:05:16,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-05 12:05:16,567 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 78 states. [2019-09-05 12:05:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:16,863 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-05 12:05:16,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-05 12:05:16,864 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-05 12:05:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:16,864 INFO L225 Difference]: With dead ends: 169 [2019-09-05 12:05:16,865 INFO L226 Difference]: Without dead ends: 164 [2019-09-05 12:05:16,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-05 12:05:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-05 12:05:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-05 12:05:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-05 12:05:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-09-05 12:05:16,869 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-09-05 12:05:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:16,869 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-09-05 12:05:16,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-05 12:05:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-09-05 12:05:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-05 12:05:16,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:16,870 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:16,870 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1069085149, now seen corresponding path program 76 times [2019-09-05 12:05:16,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:16,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:16,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:16,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:16,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:18,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:18,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:18,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:18,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:18,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:18,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 12:05:18,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:19,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:19,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-05 12:05:19,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-05 12:05:19,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-05 12:05:19,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 12:05:19,023 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2019-09-05 12:05:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:19,274 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-05 12:05:19,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-05 12:05:19,274 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2019-09-05 12:05:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:19,275 INFO L225 Difference]: With dead ends: 171 [2019-09-05 12:05:19,276 INFO L226 Difference]: Without dead ends: 166 [2019-09-05 12:05:19,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 12:05:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-05 12:05:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-05 12:05:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-05 12:05:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-09-05 12:05:19,280 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-09-05 12:05:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:19,280 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-09-05 12:05:19,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-05 12:05:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-09-05 12:05:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-05 12:05:19,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:19,282 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:19,282 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash 241716321, now seen corresponding path program 77 times [2019-09-05 12:05:19,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:19,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:19,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:19,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:21,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:21,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:21,462 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:21,560 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-05 12:05:21,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:21,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-05 12:05:21,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (78)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:05:21,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:21,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-05 12:05:21,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-05 12:05:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-05 12:05:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-05 12:05:21,600 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 80 states. [2019-09-05 12:05:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:21,837 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-05 12:05:21,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-05 12:05:21,837 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2019-09-05 12:05:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:21,838 INFO L225 Difference]: With dead ends: 173 [2019-09-05 12:05:21,838 INFO L226 Difference]: Without dead ends: 168 [2019-09-05 12:05:21,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-05 12:05:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-05 12:05:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-05 12:05:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-05 12:05:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-09-05 12:05:21,843 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-09-05 12:05:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:21,843 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-09-05 12:05:21,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-05 12:05:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-09-05 12:05:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-05 12:05:21,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:21,844 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:21,845 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:21,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1496511263, now seen corresponding path program 78 times [2019-09-05 12:05:21,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:21,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:21,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:21,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:21,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:24,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:24,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:24,035 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:24,138 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-05 12:05:24,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:24,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-05 12:05:24,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:24,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:24,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-05 12:05:24,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 12:05:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 12:05:24,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:05:24,181 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2019-09-05 12:05:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:24,492 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-05 12:05:24,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 12:05:24,493 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2019-09-05 12:05:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:24,494 INFO L225 Difference]: With dead ends: 175 [2019-09-05 12:05:24,494 INFO L226 Difference]: Without dead ends: 170 [2019-09-05 12:05:24,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:05:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-05 12:05:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-05 12:05:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-05 12:05:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-09-05 12:05:24,497 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-09-05 12:05:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:24,497 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-09-05 12:05:24,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 12:05:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-09-05 12:05:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-05 12:05:24,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:24,498 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:24,498 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash 468640349, now seen corresponding path program 79 times [2019-09-05 12:05:24,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:24,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:24,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:26,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:26,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:26,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-05 12:05:26,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:26,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:26,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-05 12:05:26,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-05 12:05:26,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-05 12:05:26,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:05:26,797 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 82 states. [2019-09-05 12:05:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:27,067 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-05 12:05:27,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 12:05:27,067 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-05 12:05:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:27,068 INFO L225 Difference]: With dead ends: 177 [2019-09-05 12:05:27,069 INFO L226 Difference]: Without dead ends: 172 [2019-09-05 12:05:27,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:05:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-05 12:05:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-05 12:05:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-05 12:05:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-09-05 12:05:27,073 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-09-05 12:05:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:27,073 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-09-05 12:05:27,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-05 12:05:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-09-05 12:05:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-05 12:05:27,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:27,075 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:27,075 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash 527170075, now seen corresponding path program 80 times [2019-09-05 12:05:27,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:27,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:27,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:29,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:29,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:29,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:29,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:29,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:29,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-05 12:05:29,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:29,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:29,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-05 12:05:29,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 12:05:29,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 12:05:29,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:05:29,376 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2019-09-05 12:05:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:29,657 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-05 12:05:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 12:05:29,658 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2019-09-05 12:05:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:29,659 INFO L225 Difference]: With dead ends: 179 [2019-09-05 12:05:29,659 INFO L226 Difference]: Without dead ends: 174 [2019-09-05 12:05:29,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:05:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-05 12:05:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-05 12:05:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-05 12:05:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-09-05 12:05:29,663 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-09-05 12:05:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:29,664 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-09-05 12:05:29,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 12:05:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-09-05 12:05:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-05 12:05:29,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:29,665 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:29,665 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash 939661913, now seen corresponding path program 81 times [2019-09-05 12:05:29,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:29,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:29,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:31,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:31,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:31,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:32,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-05 12:05:32,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:32,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 12:05:32,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:32,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:32,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-05 12:05:32,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-05 12:05:32,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-05 12:05:32,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-05 12:05:32,143 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 84 states. [2019-09-05 12:05:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:32,484 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-05 12:05:32,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-05 12:05:32,484 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2019-09-05 12:05:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:32,485 INFO L225 Difference]: With dead ends: 181 [2019-09-05 12:05:32,485 INFO L226 Difference]: Without dead ends: 176 [2019-09-05 12:05:32,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-05 12:05:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-05 12:05:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-05 12:05:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-05 12:05:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-09-05 12:05:32,490 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-09-05 12:05:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:32,490 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-09-05 12:05:32,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-05 12:05:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-09-05 12:05:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-05 12:05:32,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:32,491 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:32,492 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2087640297, now seen corresponding path program 82 times [2019-09-05 12:05:32,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:32,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:32,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:32,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:32,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:34,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:34,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:34,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:34,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:34,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:34,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-05 12:05:34,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:34,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-05 12:05:34,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-05 12:05:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-05 12:05:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:05:34,989 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2019-09-05 12:05:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:35,350 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-05 12:05:35,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 12:05:35,350 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2019-09-05 12:05:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:35,352 INFO L225 Difference]: With dead ends: 183 [2019-09-05 12:05:35,352 INFO L226 Difference]: Without dead ends: 178 [2019-09-05 12:05:35,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:05:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-05 12:05:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-05 12:05:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-05 12:05:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-09-05 12:05:35,357 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-09-05 12:05:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:35,357 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-09-05 12:05:35,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-05 12:05:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-09-05 12:05:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-05 12:05:35,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:35,358 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:35,358 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:35,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash 662762581, now seen corresponding path program 83 times [2019-09-05 12:05:35,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:35,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:35,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:35,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:35,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:37,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:37,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:37,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:37,951 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-05 12:05:37,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:37,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-05 12:05:37,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:37,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:37,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-05 12:05:37,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-05 12:05:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-05 12:05:37,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 12:05:37,994 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 86 states. [2019-09-05 12:05:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:38,338 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-05 12:05:38,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-05 12:05:38,339 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2019-09-05 12:05:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:38,340 INFO L225 Difference]: With dead ends: 185 [2019-09-05 12:05:38,340 INFO L226 Difference]: Without dead ends: 180 [2019-09-05 12:05:38,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 12:05:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-05 12:05:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-05 12:05:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-05 12:05:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-09-05 12:05:38,344 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-09-05 12:05:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:38,344 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-09-05 12:05:38,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-05 12:05:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-09-05 12:05:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-05 12:05:38,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:38,346 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:38,346 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:38,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:38,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1899925997, now seen corresponding path program 84 times [2019-09-05 12:05:38,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:38,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:38,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:38,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:38,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:40,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:40,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:40,871 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:40,987 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-05 12:05:40,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:40,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 12:05:40,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:41,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:41,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-05 12:05:41,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-05 12:05:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-05 12:05:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:05:41,023 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2019-09-05 12:05:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:41,384 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-05 12:05:41,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 12:05:41,384 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2019-09-05 12:05:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:41,385 INFO L225 Difference]: With dead ends: 187 [2019-09-05 12:05:41,385 INFO L226 Difference]: Without dead ends: 182 [2019-09-05 12:05:41,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:05:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-05 12:05:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-05 12:05:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-05 12:05:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-09-05 12:05:41,390 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-09-05 12:05:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:41,390 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-09-05 12:05:41,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-05 12:05:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-09-05 12:05:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-05 12:05:41,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:41,391 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:41,392 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:41,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash 667578449, now seen corresponding path program 85 times [2019-09-05 12:05:41,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:41,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:41,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:41,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:41,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:43,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:43,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:43,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:43,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-05 12:05:43,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:44,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:44,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-09-05 12:05:44,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 12:05:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 12:05:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:05:44,020 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 88 states. [2019-09-05 12:05:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:44,387 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-05 12:05:44,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 12:05:44,388 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2019-09-05 12:05:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:44,389 INFO L225 Difference]: With dead ends: 189 [2019-09-05 12:05:44,389 INFO L226 Difference]: Without dead ends: 184 [2019-09-05 12:05:44,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:05:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-05 12:05:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-05 12:05:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-05 12:05:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-09-05 12:05:44,392 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-09-05 12:05:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:44,392 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2019-09-05 12:05:44,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 12:05:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2019-09-05 12:05:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-05 12:05:44,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:44,393 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:44,393 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1566844145, now seen corresponding path program 86 times [2019-09-05 12:05:44,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:44,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:44,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:44,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:44,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:46,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:46,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:46,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:47,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:47,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:47,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-05 12:05:47,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:47,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:47,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-05 12:05:47,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 12:05:47,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 12:05:47,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:05:47,039 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2019-09-05 12:05:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:47,330 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-05 12:05:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 12:05:47,330 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2019-09-05 12:05:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:47,332 INFO L225 Difference]: With dead ends: 191 [2019-09-05 12:05:47,332 INFO L226 Difference]: Without dead ends: 186 [2019-09-05 12:05:47,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:05:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-05 12:05:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-05 12:05:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-05 12:05:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-09-05 12:05:47,336 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-09-05 12:05:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:47,337 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-09-05 12:05:47,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 12:05:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-09-05 12:05:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-05 12:05:47,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:47,338 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:47,338 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:47,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:47,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1363308979, now seen corresponding path program 87 times [2019-09-05 12:05:47,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:47,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:47,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:47,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:50,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:50,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:50,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:50,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-05 12:05:50,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:50,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-05 12:05:50,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:50,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:50,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-05 12:05:50,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-05 12:05:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-05 12:05:50,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:05:50,193 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 90 states. [2019-09-05 12:05:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:50,499 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-05 12:05:50,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 12:05:50,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2019-09-05 12:05:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:50,501 INFO L225 Difference]: With dead ends: 193 [2019-09-05 12:05:50,501 INFO L226 Difference]: Without dead ends: 188 [2019-09-05 12:05:50,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:05:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-05 12:05:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-05 12:05:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-05 12:05:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-09-05 12:05:50,506 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-09-05 12:05:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:50,506 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-09-05 12:05:50,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-05 12:05:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-09-05 12:05:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-05 12:05:50,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:50,508 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:50,508 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:50,508 INFO L82 PathProgramCache]: Analyzing trace with hash 960457227, now seen corresponding path program 88 times [2019-09-05 12:05:50,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:50,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:50,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:53,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:53,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:53,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:53,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:53,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:53,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-05 12:05:53,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:53,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:53,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-05 12:05:53,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-05 12:05:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-05 12:05:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:05:53,304 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states. [2019-09-05 12:05:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:53,675 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-05 12:05:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 12:05:53,676 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2019-09-05 12:05:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:53,677 INFO L225 Difference]: With dead ends: 195 [2019-09-05 12:05:53,677 INFO L226 Difference]: Without dead ends: 190 [2019-09-05 12:05:53,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:05:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-05 12:05:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-05 12:05:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-05 12:05:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-09-05 12:05:53,680 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-09-05 12:05:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:53,680 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-09-05 12:05:53,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-05 12:05:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-09-05 12:05:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-05 12:05:53,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:53,681 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:53,682 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash 716787273, now seen corresponding path program 89 times [2019-09-05 12:05:53,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:53,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:56,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:56,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:56,547 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-05 12:05:56,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:56,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-05 12:05:56,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:56,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:56,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-05 12:05:56,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-05 12:05:56,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-05 12:05:56,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 12:05:56,582 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 92 states. [2019-09-05 12:05:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:56,921 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-05 12:05:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-05 12:05:56,921 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2019-09-05 12:05:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:56,922 INFO L225 Difference]: With dead ends: 197 [2019-09-05 12:05:56,922 INFO L226 Difference]: Without dead ends: 192 [2019-09-05 12:05:56,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 12:05:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-05 12:05:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-05 12:05:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-05 12:05:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-09-05 12:05:56,926 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-09-05 12:05:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:56,926 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-09-05 12:05:56,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-05 12:05:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-09-05 12:05:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-05 12:05:56,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:56,927 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:56,927 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1521804537, now seen corresponding path program 90 times [2019-09-05 12:05:56,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:56,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:56,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:56,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:56,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:59,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:59,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:59,755 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:59,879 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-09-05 12:05:59,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:59,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 12:05:59,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:59,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:59,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-05 12:05:59,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-05 12:05:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-05 12:05:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:05:59,916 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 93 states. [2019-09-05 12:06:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:00,217 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-05 12:06:00,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 12:06:00,218 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2019-09-05 12:06:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:00,219 INFO L225 Difference]: With dead ends: 199 [2019-09-05 12:06:00,219 INFO L226 Difference]: Without dead ends: 194 [2019-09-05 12:06:00,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:06:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-05 12:06:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-05 12:06:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-05 12:06:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-09-05 12:06:00,223 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-09-05 12:06:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:00,224 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-09-05 12:06:00,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-05 12:06:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-09-05 12:06:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-05 12:06:00,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:00,225 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:00,225 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1029918651, now seen corresponding path program 91 times [2019-09-05 12:06:00,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:00,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:00,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:03,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:03,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:03,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:03,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 12:06:03,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:03,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:03,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-05 12:06:03,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-05 12:06:03,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-05 12:06:03,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-05 12:06:03,198 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 94 states. [2019-09-05 12:06:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:03,597 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-05 12:06:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-05 12:06:03,598 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 192 [2019-09-05 12:06:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:03,599 INFO L225 Difference]: With dead ends: 201 [2019-09-05 12:06:03,599 INFO L226 Difference]: Without dead ends: 196 [2019-09-05 12:06:03,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-05 12:06:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-05 12:06:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-05 12:06:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-05 12:06:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-09-05 12:06:03,602 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-09-05 12:06:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:03,602 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2019-09-05 12:06:03,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-05 12:06:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2019-09-05 12:06:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-05 12:06:03,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:03,603 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:03,603 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:03,604 INFO L82 PathProgramCache]: Analyzing trace with hash -773984765, now seen corresponding path program 92 times [2019-09-05 12:06:03,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:03,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:03,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:06,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:06,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:06,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:06,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:06,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:06,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-05 12:06:06,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:06,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:06,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-05 12:06:06,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 12:06:06,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 12:06:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:06:06,629 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 95 states. [2019-09-05 12:06:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:07,043 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-05 12:06:07,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-05 12:06:07,043 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2019-09-05 12:06:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:07,044 INFO L225 Difference]: With dead ends: 203 [2019-09-05 12:06:07,044 INFO L226 Difference]: Without dead ends: 198 [2019-09-05 12:06:07,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:06:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-05 12:06:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-05 12:06:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-05 12:06:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-09-05 12:06:07,050 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-09-05 12:06:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:07,051 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-09-05 12:06:07,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 12:06:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-09-05 12:06:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-05 12:06:07,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:07,052 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:07,052 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:07,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:07,053 INFO L82 PathProgramCache]: Analyzing trace with hash 365343809, now seen corresponding path program 93 times [2019-09-05 12:06:07,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:07,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:07,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:07,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:07,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:10,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:10,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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:10,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:10,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-05 12:06:10,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:10,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 12:06:10,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:10,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-05 12:06:10,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-05 12:06:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-05 12:06:10,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 12:06:10,494 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 96 states. [2019-09-05 12:06:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:10,944 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-05 12:06:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-05 12:06:10,944 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 196 [2019-09-05 12:06:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:10,945 INFO L225 Difference]: With dead ends: 205 [2019-09-05 12:06:10,945 INFO L226 Difference]: Without dead ends: 200 [2019-09-05 12:06:10,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 12:06:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-05 12:06:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-05 12:06:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-05 12:06:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-09-05 12:06:10,950 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-09-05 12:06:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:10,950 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-09-05 12:06:10,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-05 12:06:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-09-05 12:06:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-05 12:06:10,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:10,951 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:10,951 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash 43442943, now seen corresponding path program 94 times [2019-09-05 12:06:10,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:10,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:10,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:10,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:10,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:14,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:14,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:06:14,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:06:14,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:14,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-05 12:06:14,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (95)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:06:14,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:14,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-05 12:06:14,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-05 12:06:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-05 12:06:14,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:06:14,137 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 97 states. [2019-09-05 12:06:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:14,572 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-05 12:06:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-05 12:06:14,573 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2019-09-05 12:06:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:14,574 INFO L225 Difference]: With dead ends: 207 [2019-09-05 12:06:14,574 INFO L226 Difference]: Without dead ends: 202 [2019-09-05 12:06:14,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:06:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-05 12:06:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-05 12:06:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-05 12:06:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-09-05 12:06:14,578 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-09-05 12:06:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:14,578 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-09-05 12:06:14,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-05 12:06:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-09-05 12:06:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-05 12:06:14,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:14,580 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:14,580 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash -65643971, now seen corresponding path program 95 times [2019-09-05 12:06:14,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:14,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:14,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:14,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:14,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:17,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:17,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:17,707 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:06:17,827 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-09-05 12:06:17,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:17,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-05 12:06:17,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:17,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:17,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-05 12:06:17,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-05 12:06:17,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-05 12:06:17,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-05 12:06:17,866 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 98 states. [2019-09-05 12:06:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:18,209 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-05 12:06:18,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-05 12:06:18,210 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 200 [2019-09-05 12:06:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:18,211 INFO L225 Difference]: With dead ends: 209 [2019-09-05 12:06:18,211 INFO L226 Difference]: Without dead ends: 204 [2019-09-05 12:06:18,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-05 12:06:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-05 12:06:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-05 12:06:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-05 12:06:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-09-05 12:06:18,215 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-09-05 12:06:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:18,216 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-09-05 12:06:18,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-05 12:06:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-09-05 12:06:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-05 12:06:18,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:18,217 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:18,217 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:18,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:18,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1818953221, now seen corresponding path program 96 times [2019-09-05 12:06:18,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:18,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:18,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:18,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:18,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:21,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:21,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:21,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:21,530 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-09-05 12:06:21,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:21,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 12:06:21,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:21,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:21,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-05 12:06:21,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 12:06:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 12:06:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:06:21,570 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 99 states. [2019-09-05 12:06:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:21,889 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-09-05 12:06:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-05 12:06:21,889 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2019-09-05 12:06:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:21,891 INFO L225 Difference]: With dead ends: 211 [2019-09-05 12:06:21,891 INFO L226 Difference]: Without dead ends: 206 [2019-09-05 12:06:21,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:06:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-05 12:06:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-05 12:06:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-05 12:06:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-09-05 12:06:21,896 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-09-05 12:06:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:21,896 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-09-05 12:06:21,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 12:06:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-09-05 12:06:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-05 12:06:21,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:21,897 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:21,897 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1173004857, now seen corresponding path program 97 times [2019-09-05 12:06:21,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:21,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:21,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:25,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:25,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:25,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-05 12:06:25,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:25,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:25,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-05 12:06:25,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-05 12:06:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-05 12:06:25,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-05 12:06:25,273 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 100 states. [2019-09-05 12:06:25,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:25,693 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-09-05 12:06:25,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-05 12:06:25,693 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 204 [2019-09-05 12:06:25,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:25,694 INFO L225 Difference]: With dead ends: 213 [2019-09-05 12:06:25,694 INFO L226 Difference]: Without dead ends: 208 [2019-09-05 12:06:25,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-05 12:06:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-05 12:06:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-05 12:06:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-05 12:06:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-09-05 12:06:25,698 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2019-09-05 12:06:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:25,698 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-09-05 12:06:25,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-05 12:06:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-09-05 12:06:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-05 12:06:25,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:25,700 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:25,700 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:25,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1183370505, now seen corresponding path program 98 times [2019-09-05 12:06:25,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:25,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:25,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:29,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:29,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:29,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:29,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:29,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:29,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-05 12:06:29,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:29,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:29,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-05 12:06:29,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-05 12:06:29,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-05 12:06:29,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:06:29,158 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 101 states. [2019-09-05 12:06:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:29,519 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-09-05 12:06:29,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-05 12:06:29,519 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2019-09-05 12:06:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:29,520 INFO L225 Difference]: With dead ends: 215 [2019-09-05 12:06:29,520 INFO L226 Difference]: Without dead ends: 210 [2019-09-05 12:06:29,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:06:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-05 12:06:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-05 12:06:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-05 12:06:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-09-05 12:06:29,524 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2019-09-05 12:06:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:29,525 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-09-05 12:06:29,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-05 12:06:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-09-05 12:06:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-05 12:06:29,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:29,526 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:29,527 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:29,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2082638901, now seen corresponding path program 99 times [2019-09-05 12:06:29,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:29,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:29,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:29,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:29,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:32,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:32,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:32,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:33,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-09-05 12:06:33,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:33,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-05 12:06:33,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:33,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:33,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-05 12:06:33,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-05 12:06:33,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-05 12:06:33,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 12:06:33,140 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 102 states. [2019-09-05 12:06:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:33,585 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-09-05 12:06:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-05 12:06:33,585 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2019-09-05 12:06:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:33,586 INFO L225 Difference]: With dead ends: 217 [2019-09-05 12:06:33,587 INFO L226 Difference]: Without dead ends: 212 [2019-09-05 12:06:33,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 12:06:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-05 12:06:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-09-05 12:06:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-05 12:06:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-09-05 12:06:33,591 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2019-09-05 12:06:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:33,592 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-09-05 12:06:33,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-05 12:06:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-09-05 12:06:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-05 12:06:33,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:33,593 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:33,594 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1096584691, now seen corresponding path program 100 times [2019-09-05 12:06:33,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:33,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:33,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:37,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:37,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:06:37,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:06:37,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:37,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-05 12:06:37,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:37,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:37,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-05 12:06:37,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-05 12:06:37,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-05 12:06:37,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-05 12:06:37,212 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 103 states. [2019-09-05 12:06:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:37,569 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-09-05 12:06:37,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-05 12:06:37,569 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 210 [2019-09-05 12:06:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:37,570 INFO L225 Difference]: With dead ends: 219 [2019-09-05 12:06:37,570 INFO L226 Difference]: Without dead ends: 214 [2019-09-05 12:06:37,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-05 12:06:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-05 12:06:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-09-05 12:06:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-05 12:06:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-09-05 12:06:37,574 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2019-09-05 12:06:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:37,574 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-09-05 12:06:37,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-05 12:06:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-09-05 12:06:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-05 12:06:37,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:37,576 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:37,576 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:37,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1608705999, now seen corresponding path program 101 times [2019-09-05 12:06:37,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:37,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:37,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:37,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:37,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:41,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:41,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:41,157 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:06:41,290 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2019-09-05 12:06:41,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:41,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-05 12:06:41,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:41,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:41,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-09-05 12:06:41,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-05 12:06:41,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-05 12:06:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-05 12:06:41,351 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 104 states. [2019-09-05 12:06:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:41,732 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-09-05 12:06:41,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-05 12:06:41,733 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 212 [2019-09-05 12:06:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:41,733 INFO L225 Difference]: With dead ends: 221 [2019-09-05 12:06:41,733 INFO L226 Difference]: Without dead ends: 216 [2019-09-05 12:06:41,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-05 12:06:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-05 12:06:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-05 12:06:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-05 12:06:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-09-05 12:06:41,737 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2019-09-05 12:06:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:41,738 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2019-09-05 12:06:41,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-05 12:06:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2019-09-05 12:06:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-05 12:06:41,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:41,739 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:41,739 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1357122287, now seen corresponding path program 102 times [2019-09-05 12:06:41,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:41,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:41,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:45,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:45,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:45,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:45,441 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2019-09-05 12:06:45,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:45,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-05 12:06:45,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:45,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:45,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-05 12:06:45,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-05 12:06:45,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-05 12:06:45,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-05 12:06:45,487 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 105 states. [2019-09-05 12:06:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:45,855 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-09-05 12:06:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-05 12:06:45,855 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 214 [2019-09-05 12:06:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:45,856 INFO L225 Difference]: With dead ends: 223 [2019-09-05 12:06:45,856 INFO L226 Difference]: Without dead ends: 218 [2019-09-05 12:06:45,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-05 12:06:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-05 12:06:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-05 12:06:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-05 12:06:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-09-05 12:06:45,861 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2019-09-05 12:06:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:45,861 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-09-05 12:06:45,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-05 12:06:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-09-05 12:06:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-05 12:06:45,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:45,862 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:45,862 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:45,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash -340179411, now seen corresponding path program 103 times [2019-09-05 12:06:45,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:45,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:45,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:45,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:45,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:49,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:49,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:49,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:49,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-05 12:06:49,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:49,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:49,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2019-09-05 12:06:49,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-05 12:06:49,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-05 12:06:49,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-05 12:06:49,625 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 106 states. [2019-09-05 12:06:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:50,057 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-09-05 12:06:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-05 12:06:50,057 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 216 [2019-09-05 12:06:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:50,058 INFO L225 Difference]: With dead ends: 225 [2019-09-05 12:06:50,058 INFO L226 Difference]: Without dead ends: 220 [2019-09-05 12:06:50,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-05 12:06:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-05 12:06:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-09-05 12:06:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-05 12:06:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-09-05 12:06:50,063 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2019-09-05 12:06:50,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:50,063 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2019-09-05 12:06:50,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-05 12:06:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2019-09-05 12:06:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-05 12:06:50,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:50,064 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:50,065 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash 640461291, now seen corresponding path program 104 times [2019-09-05 12:06:50,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:50,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:50,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:53,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:53,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:53,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:53,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:53,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-05 12:06:53,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:53,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:53,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-05 12:06:53,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-05 12:06:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-05 12:06:53,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-05 12:06:53,979 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 107 states. [2019-09-05 12:06:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:54,329 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-09-05 12:06:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-05 12:06:54,329 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 218 [2019-09-05 12:06:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:54,330 INFO L225 Difference]: With dead ends: 227 [2019-09-05 12:06:54,331 INFO L226 Difference]: Without dead ends: 222 [2019-09-05 12:06:54,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-05 12:06:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-05 12:06:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-09-05 12:06:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-05 12:06:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-09-05 12:06:54,336 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2019-09-05 12:06:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:54,336 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-09-05 12:06:54,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-05 12:06:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-09-05 12:06:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-05 12:06:54,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:54,337 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:54,337 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1856629207, now seen corresponding path program 105 times [2019-09-05 12:06:54,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:54,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:58,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:58,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:58,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2019-09-05 12:06:58,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:58,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-05 12:06:58,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:58,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:58,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2019-09-05 12:06:58,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-05 12:06:58,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-05 12:06:58,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-05 12:06:58,366 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 108 states. [2019-09-05 12:06:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:58,777 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-09-05 12:06:58,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-05 12:06:58,777 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 220 [2019-09-05 12:06:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:58,778 INFO L225 Difference]: With dead ends: 229 [2019-09-05 12:06:58,778 INFO L226 Difference]: Without dead ends: 224 [2019-09-05 12:06:58,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-05 12:06:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-05 12:06:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-09-05 12:06:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-05 12:06:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-09-05 12:06:58,781 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2019-09-05 12:06:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:58,782 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-09-05 12:06:58,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-05 12:06:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-09-05 12:06:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-05 12:06:58,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:58,783 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:58,783 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash -673879321, now seen corresponding path program 106 times [2019-09-05 12:06:58,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:58,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:58,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:02,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:02,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:02,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:07:02,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:07:02,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:02,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-05 12:07:02,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:02,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:02,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-05 12:07:02,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-05 12:07:02,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-05 12:07:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-05 12:07:02,734 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 109 states. [2019-09-05 12:07:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:03,186 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-09-05 12:07:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-05 12:07:03,187 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 222 [2019-09-05 12:07:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:03,187 INFO L225 Difference]: With dead ends: 231 [2019-09-05 12:07:03,188 INFO L226 Difference]: Without dead ends: 226 [2019-09-05 12:07:03,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-05 12:07:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-05 12:07:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-09-05 12:07:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-05 12:07:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-09-05 12:07:03,191 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2019-09-05 12:07:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:03,191 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-09-05 12:07:03,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-05 12:07:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-09-05 12:07:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-05 12:07:03,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:03,192 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:03,192 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2077394981, now seen corresponding path program 107 times [2019-09-05 12:07:03,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:03,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:03,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:07,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:07,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:07:07,283 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2019-09-05 12:07:07,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:07,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-05 12:07:07,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:07,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:07,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2019-09-05 12:07:07,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-05 12:07:07,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-05 12:07:07,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-05 12:07:07,327 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 110 states. [2019-09-05 12:07:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:07,720 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-09-05 12:07:07,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-05 12:07:07,721 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 224 [2019-09-05 12:07:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:07,722 INFO L225 Difference]: With dead ends: 233 [2019-09-05 12:07:07,722 INFO L226 Difference]: Without dead ends: 228 [2019-09-05 12:07:07,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-05 12:07:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-05 12:07:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-09-05 12:07:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-05 12:07:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-09-05 12:07:07,726 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2019-09-05 12:07:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:07,726 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-09-05 12:07:07,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-05 12:07:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-09-05 12:07:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-05 12:07:07,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:07,727 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:07,727 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:07,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:07,727 INFO L82 PathProgramCache]: Analyzing trace with hash 352144867, now seen corresponding path program 108 times [2019-09-05 12:07:07,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:07,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:07,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:11,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:11,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:11,785 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:07:11,944 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2019-09-05 12:07:11,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:11,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-05 12:07:11,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:11,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:11,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-05 12:07:11,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-05 12:07:11,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-05 12:07:11,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-05 12:07:11,991 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 111 states. [2019-09-05 12:07:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:12,454 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-09-05 12:07:12,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-05 12:07:12,454 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 226 [2019-09-05 12:07:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:12,455 INFO L225 Difference]: With dead ends: 235 [2019-09-05 12:07:12,455 INFO L226 Difference]: Without dead ends: 230 [2019-09-05 12:07:12,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-05 12:07:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-05 12:07:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-09-05 12:07:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-05 12:07:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-09-05 12:07:12,458 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2019-09-05 12:07:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:12,458 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-09-05 12:07:12,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-05 12:07:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-09-05 12:07:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-05 12:07:12,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:12,459 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:12,459 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:12,459 INFO L82 PathProgramCache]: Analyzing trace with hash 244161569, now seen corresponding path program 109 times [2019-09-05 12:07:12,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:12,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:12,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:12,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:12,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:16,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:16,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:16,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:16,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-05 12:07:16,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:16,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:16,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2019-09-05 12:07:16,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-05 12:07:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-05 12:07:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-05 12:07:16,646 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 112 states. [2019-09-05 12:07:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:17,112 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-09-05 12:07:17,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-05 12:07:17,113 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 228 [2019-09-05 12:07:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:17,113 INFO L225 Difference]: With dead ends: 237 [2019-09-05 12:07:17,113 INFO L226 Difference]: Without dead ends: 232 [2019-09-05 12:07:17,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-05 12:07:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-05 12:07:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2019-09-05 12:07:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-05 12:07:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-09-05 12:07:17,116 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2019-09-05 12:07:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:17,117 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-09-05 12:07:17,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-05 12:07:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-09-05 12:07:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-05 12:07:17,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:17,118 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:17,118 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash -448572705, now seen corresponding path program 110 times [2019-09-05 12:07:17,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:17,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:17,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:17,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:17,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:21,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:21,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:21,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:07:21,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:07:21,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:21,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-05 12:07:21,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:21,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:21,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-05 12:07:21,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-05 12:07:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-05 12:07:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-05 12:07:21,340 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 113 states. [2019-09-05 12:07:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:21,878 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-09-05 12:07:21,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-05 12:07:21,879 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 230 [2019-09-05 12:07:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:21,879 INFO L225 Difference]: With dead ends: 239 [2019-09-05 12:07:21,879 INFO L226 Difference]: Without dead ends: 234 [2019-09-05 12:07:21,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-05 12:07:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-05 12:07:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-09-05 12:07:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-05 12:07:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-09-05 12:07:21,882 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2019-09-05 12:07:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:21,883 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-09-05 12:07:21,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-05 12:07:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-09-05 12:07:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-05 12:07:21,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:21,883 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:21,884 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash -446279139, now seen corresponding path program 111 times [2019-09-05 12:07:21,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:21,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:21,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:21,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:26,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:26,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:26,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:07:26,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2019-09-05 12:07:26,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:26,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-05 12:07:26,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:26,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:26,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2019-09-05 12:07:26,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-05 12:07:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-05 12:07:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-05 12:07:26,357 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 114 states. [2019-09-05 12:07:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:26,858 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-09-05 12:07:26,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-05 12:07:26,859 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 232 [2019-09-05 12:07:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:26,859 INFO L225 Difference]: With dead ends: 241 [2019-09-05 12:07:26,859 INFO L226 Difference]: Without dead ends: 236 [2019-09-05 12:07:26,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-05 12:07:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-05 12:07:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-09-05 12:07:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-05 12:07:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-09-05 12:07:26,862 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2019-09-05 12:07:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:26,863 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-09-05 12:07:26,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-05 12:07:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-09-05 12:07:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-05 12:07:26,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:26,863 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:26,864 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1757837787, now seen corresponding path program 112 times [2019-09-05 12:07:26,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:26,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:26,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:31,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:31,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:31,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:07:31,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:07:31,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:31,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-05 12:07:31,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (113)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:07:31,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-05 12:07:31,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-05 12:07:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-05 12:07:31,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-05 12:07:31,412 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 115 states. [2019-09-05 12:07:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:31,881 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-09-05 12:07:31,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-05 12:07:31,882 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 234 [2019-09-05 12:07:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:31,882 INFO L225 Difference]: With dead ends: 243 [2019-09-05 12:07:31,882 INFO L226 Difference]: Without dead ends: 238 [2019-09-05 12:07:31,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-05 12:07:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-05 12:07:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-09-05 12:07:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-05 12:07:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-09-05 12:07:31,887 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2019-09-05 12:07:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:31,887 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-09-05 12:07:31,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-05 12:07:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-09-05 12:07:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-05 12:07:31,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:31,888 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:31,888 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1799640551, now seen corresponding path program 113 times [2019-09-05 12:07:31,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:31,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:31,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:31,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:31,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:36,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:36,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:36,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:07:36,427 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2019-09-05 12:07:36,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:36,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-05 12:07:36,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:36,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:36,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2019-09-05 12:07:36,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-05 12:07:36,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-05 12:07:36,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-05 12:07:36,478 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 116 states. [2019-09-05 12:07:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:36,949 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-09-05 12:07:36,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-05 12:07:36,949 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 236 [2019-09-05 12:07:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:36,950 INFO L225 Difference]: With dead ends: 245 [2019-09-05 12:07:36,950 INFO L226 Difference]: Without dead ends: 240 [2019-09-05 12:07:36,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-05 12:07:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-05 12:07:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-09-05 12:07:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-05 12:07:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-09-05 12:07:36,953 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2019-09-05 12:07:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:36,953 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2019-09-05 12:07:36,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-05 12:07:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2019-09-05 12:07:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-05 12:07:36,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:36,954 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:36,954 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1742355753, now seen corresponding path program 114 times [2019-09-05 12:07:36,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:36,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:36,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:36,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:36,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:41,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:41,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:41,479 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:07:41,637 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2019-09-05 12:07:41,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:41,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-05 12:07:41,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:41,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:41,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-05 12:07:41,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-05 12:07:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-05 12:07:41,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:07:41,689 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 117 states. [2019-09-05 12:07:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:42,215 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-09-05 12:07:42,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-05 12:07:42,215 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 238 [2019-09-05 12:07:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:42,216 INFO L225 Difference]: With dead ends: 247 [2019-09-05 12:07:42,216 INFO L226 Difference]: Without dead ends: 242 [2019-09-05 12:07:42,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:07:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-05 12:07:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-09-05 12:07:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-05 12:07:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-09-05 12:07:42,219 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2019-09-05 12:07:42,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:42,219 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-09-05 12:07:42,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-05 12:07:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-09-05 12:07:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-05 12:07:42,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:42,220 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:42,220 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:42,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1768727573, now seen corresponding path program 115 times [2019-09-05 12:07:42,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:42,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:42,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:46,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:46,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:46,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:46,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-05 12:07:46,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:46,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:46,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2019-09-05 12:07:46,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-05 12:07:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-05 12:07:46,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-05 12:07:46,840 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 118 states. [2019-09-05 12:07:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:47,428 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-09-05 12:07:47,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-05 12:07:47,428 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 240 [2019-09-05 12:07:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:47,429 INFO L225 Difference]: With dead ends: 249 [2019-09-05 12:07:47,429 INFO L226 Difference]: Without dead ends: 244 [2019-09-05 12:07:47,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-05 12:07:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-05 12:07:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2019-09-05 12:07:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-05 12:07:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2019-09-05 12:07:47,433 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2019-09-05 12:07:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:47,433 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2019-09-05 12:07:47,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-05 12:07:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2019-09-05 12:07:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-05 12:07:47,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:47,435 INFO L399 BasicCegarLoop]: trace histogram [116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:47,435 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:47,435 INFO L82 PathProgramCache]: Analyzing trace with hash 75509203, now seen corresponding path program 116 times [2019-09-05 12:07:47,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:47,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:47,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:52,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:52,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:52,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:07:52,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:07:52,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:52,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-05 12:07:52,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:52,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:52,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-05 12:07:52,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-05 12:07:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-05 12:07:52,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-05 12:07:52,172 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 119 states. [2019-09-05 12:07:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:52,714 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-09-05 12:07:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-05 12:07:52,715 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 242 [2019-09-05 12:07:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:52,715 INFO L225 Difference]: With dead ends: 251 [2019-09-05 12:07:52,715 INFO L226 Difference]: Without dead ends: 246 [2019-09-05 12:07:52,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-05 12:07:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-05 12:07:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-09-05 12:07:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-05 12:07:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-09-05 12:07:52,719 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2019-09-05 12:07:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:52,719 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-09-05 12:07:52,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-05 12:07:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-09-05 12:07:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-05 12:07:52,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:52,720 INFO L399 BasicCegarLoop]: trace histogram [117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:52,720 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash 685260817, now seen corresponding path program 117 times [2019-09-05 12:07:52,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:52,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:52,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:57,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:57,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:57,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:07:57,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2019-09-05 12:07:57,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:57,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-05 12:07:57,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:57,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:57,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2019-09-05 12:07:57,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-05 12:07:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-05 12:07:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-05 12:07:57,610 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 120 states. [2019-09-05 12:07:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:58,169 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-09-05 12:07:58,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-05 12:07:58,170 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 244 [2019-09-05 12:07:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:58,171 INFO L225 Difference]: With dead ends: 253 [2019-09-05 12:07:58,171 INFO L226 Difference]: Without dead ends: 248 [2019-09-05 12:07:58,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-05 12:07:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-05 12:07:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-09-05 12:07:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-05 12:07:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-09-05 12:07:58,174 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2019-09-05 12:07:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:58,174 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-09-05 12:07:58,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-05 12:07:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-09-05 12:07:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-05 12:07:58,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:58,175 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:58,175 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:58,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1753957681, now seen corresponding path program 118 times [2019-09-05 12:07:58,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:58,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:58,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:02,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:02,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:02,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:08:03,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:08:03,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:03,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-05 12:08:03,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:03,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:03,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-05 12:08:03,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-05 12:08:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-05 12:08:03,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-05 12:08:03,052 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 121 states. [2019-09-05 12:08:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:03,519 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-09-05 12:08:03,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-05 12:08:03,520 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 246 [2019-09-05 12:08:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:03,521 INFO L225 Difference]: With dead ends: 255 [2019-09-05 12:08:03,521 INFO L226 Difference]: Without dead ends: 250 [2019-09-05 12:08:03,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-05 12:08:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-05 12:08:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-09-05 12:08:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-05 12:08:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-09-05 12:08:03,526 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2019-09-05 12:08:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:03,526 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-09-05 12:08:03,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-05 12:08:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-09-05 12:08:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-05 12:08:03,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:03,527 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:03,527 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash -790790643, now seen corresponding path program 119 times [2019-09-05 12:08:03,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:03,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:03,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:08,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:08,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:08,387 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:08:08,557 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2019-09-05 12:08:08,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:08,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-05 12:08:08,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:08,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:08,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2019-09-05 12:08:08,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-05 12:08:08,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-05 12:08:08,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-05 12:08:08,625 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 122 states. [2019-09-05 12:08:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:09,227 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2019-09-05 12:08:09,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-05 12:08:09,227 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 248 [2019-09-05 12:08:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:09,228 INFO L225 Difference]: With dead ends: 257 [2019-09-05 12:08:09,228 INFO L226 Difference]: Without dead ends: 252 [2019-09-05 12:08:09,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-05 12:08:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-05 12:08:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-09-05 12:08:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-05 12:08:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-09-05 12:08:09,231 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2019-09-05 12:08:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:09,231 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-09-05 12:08:09,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-05 12:08:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-09-05 12:08:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-05 12:08:09,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:09,233 INFO L399 BasicCegarLoop]: trace histogram [120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:09,233 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1394764235, now seen corresponding path program 120 times [2019-09-05 12:08:09,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:09,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:09,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:09,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:09,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:14,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:14,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:14,125 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:08:14,302 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2019-09-05 12:08:14,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:14,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-05 12:08:14,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:14,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:14,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-05 12:08:14,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-05 12:08:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-05 12:08:14,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-05 12:08:14,378 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 123 states. [2019-09-05 12:08:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:14,940 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-09-05 12:08:14,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-05 12:08:14,941 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 250 [2019-09-05 12:08:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:14,941 INFO L225 Difference]: With dead ends: 259 [2019-09-05 12:08:14,942 INFO L226 Difference]: Without dead ends: 254 [2019-09-05 12:08:14,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-05 12:08:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-05 12:08:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-09-05 12:08:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-05 12:08:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-09-05 12:08:14,945 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2019-09-05 12:08:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:14,945 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-09-05 12:08:14,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-05 12:08:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-09-05 12:08:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-05 12:08:14,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:14,946 INFO L399 BasicCegarLoop]: trace histogram [121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:14,946 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1473994249, now seen corresponding path program 121 times [2019-09-05 12:08:14,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:14,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:14,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:19,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:19,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:19,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:20,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-05 12:08:20,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:20,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:20,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2019-09-05 12:08:20,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-05 12:08:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-05 12:08:20,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-05 12:08:20,058 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 124 states. [2019-09-05 12:08:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:20,513 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-09-05 12:08:20,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-05 12:08:20,514 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 252 [2019-09-05 12:08:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:20,515 INFO L225 Difference]: With dead ends: 261 [2019-09-05 12:08:20,515 INFO L226 Difference]: Without dead ends: 256 [2019-09-05 12:08:20,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-05 12:08:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-05 12:08:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2019-09-05 12:08:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-05 12:08:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2019-09-05 12:08:20,519 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2019-09-05 12:08:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:20,520 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2019-09-05 12:08:20,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-05 12:08:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2019-09-05 12:08:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-05 12:08:20,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:20,522 INFO L399 BasicCegarLoop]: trace histogram [122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:20,522 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash 304626375, now seen corresponding path program 122 times [2019-09-05 12:08:20,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:20,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:20,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:20,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:20,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:25,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:25,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:25,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:08:25,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:08:25,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:25,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-05 12:08:25,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:25,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:25,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-05 12:08:25,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-05 12:08:25,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-05 12:08:25,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-05 12:08:25,731 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 125 states. [2019-09-05 12:08:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:26,343 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-09-05 12:08:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-05 12:08:26,343 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 254 [2019-09-05 12:08:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:26,344 INFO L225 Difference]: With dead ends: 263 [2019-09-05 12:08:26,344 INFO L226 Difference]: Without dead ends: 258 [2019-09-05 12:08:26,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-05 12:08:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-05 12:08:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-09-05 12:08:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-05 12:08:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-09-05 12:08:26,347 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2019-09-05 12:08:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:26,347 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-09-05 12:08:26,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-05 12:08:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-09-05 12:08:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-05 12:08:26,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:26,348 INFO L399 BasicCegarLoop]: trace histogram [123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:26,348 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1823531013, now seen corresponding path program 123 times [2019-09-05 12:08:26,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:26,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:26,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:31,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:31,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:31,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:08:31,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2019-09-05 12:08:31,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:31,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-05 12:08:31,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:31,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:31,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2019-09-05 12:08:31,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-05 12:08:31,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-05 12:08:31,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-05 12:08:31,747 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 126 states. [2019-09-05 12:08:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:32,196 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-09-05 12:08:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-05 12:08:32,197 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 256 [2019-09-05 12:08:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:32,198 INFO L225 Difference]: With dead ends: 265 [2019-09-05 12:08:32,198 INFO L226 Difference]: Without dead ends: 260 [2019-09-05 12:08:32,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-05 12:08:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-05 12:08:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-09-05 12:08:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-05 12:08:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-09-05 12:08:32,203 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2019-09-05 12:08:32,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:32,203 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-09-05 12:08:32,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-05 12:08:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-09-05 12:08:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-05 12:08:32,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:32,205 INFO L399 BasicCegarLoop]: trace histogram [124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:32,205 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1202007491, now seen corresponding path program 124 times [2019-09-05 12:08:32,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:32,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:32,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:32,416 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-09-05 12:08:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:37,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:37,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:37,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:08:37,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:08:37,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:37,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-05 12:08:37,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:37,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:37,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-05 12:08:37,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-05 12:08:37,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-05 12:08:37,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-05 12:08:37,695 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 127 states. [2019-09-05 12:08:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:38,304 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-09-05 12:08:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-05 12:08:38,304 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 258 [2019-09-05 12:08:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:38,305 INFO L225 Difference]: With dead ends: 267 [2019-09-05 12:08:38,305 INFO L226 Difference]: Without dead ends: 262 [2019-09-05 12:08:38,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-05 12:08:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-05 12:08:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-09-05 12:08:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-05 12:08:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-09-05 12:08:38,308 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2019-09-05 12:08:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:38,309 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-09-05 12:08:38,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-05 12:08:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-09-05 12:08:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-05 12:08:38,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:38,310 INFO L399 BasicCegarLoop]: trace histogram [125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:38,310 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:38,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:38,310 INFO L82 PathProgramCache]: Analyzing trace with hash 918356993, now seen corresponding path program 125 times [2019-09-05 12:08:38,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:38,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:38,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:38,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:38,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:43,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:43,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:43,773 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:08:43,948 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2019-09-05 12:08:43,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:43,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-05 12:08:43,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:44,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:44,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2019-09-05 12:08:44,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-05 12:08:44,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-05 12:08:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-05 12:08:44,007 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 128 states. [2019-09-05 12:08:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:44,552 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2019-09-05 12:08:44,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-05 12:08:44,552 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 260 [2019-09-05 12:08:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:44,553 INFO L225 Difference]: With dead ends: 269 [2019-09-05 12:08:44,553 INFO L226 Difference]: Without dead ends: 264 [2019-09-05 12:08:44,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-05 12:08:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-05 12:08:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-09-05 12:08:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-05 12:08:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-09-05 12:08:44,556 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2019-09-05 12:08:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:44,556 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2019-09-05 12:08:44,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-05 12:08:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2019-09-05 12:08:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-05 12:08:44,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:44,557 INFO L399 BasicCegarLoop]: trace histogram [126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:44,557 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1086831937, now seen corresponding path program 126 times [2019-09-05 12:08:44,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:44,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:44,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:44,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:49,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:49,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:49,956 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:08:50,139 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2019-09-05 12:08:50,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:50,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-05 12:08:50,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:50,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:50,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-05 12:08:50,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-05 12:08:50,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-05 12:08:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 12:08:50,199 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 129 states. [2019-09-05 12:08:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:50,911 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-09-05 12:08:50,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-05 12:08:50,912 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 262 [2019-09-05 12:08:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:50,912 INFO L225 Difference]: With dead ends: 271 [2019-09-05 12:08:50,913 INFO L226 Difference]: Without dead ends: 266 [2019-09-05 12:08:50,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 12:08:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-05 12:08:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-09-05 12:08:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-05 12:08:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-09-05 12:08:50,917 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2019-09-05 12:08:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:50,918 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-09-05 12:08:50,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-05 12:08:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-09-05 12:08:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-05 12:08:50,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:50,919 INFO L399 BasicCegarLoop]: trace histogram [127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:50,919 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:50,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:50,919 INFO L82 PathProgramCache]: Analyzing trace with hash 366922237, now seen corresponding path program 127 times [2019-09-05 12:08:50,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:50,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:50,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:50,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:50,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:56,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:56,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:56,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:56,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-05 12:08:56,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:56,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 130 [2019-09-05 12:08:56,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-05 12:08:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-05 12:08:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-05 12:08:56,516 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 130 states. [2019-09-05 12:08:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:57,165 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-09-05 12:08:57,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-05 12:08:57,165 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 264 [2019-09-05 12:08:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:57,166 INFO L225 Difference]: With dead ends: 273 [2019-09-05 12:08:57,166 INFO L226 Difference]: Without dead ends: 268 [2019-09-05 12:08:57,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-05 12:08:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-05 12:08:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2019-09-05 12:08:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-05 12:08:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-09-05 12:08:57,170 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2019-09-05 12:08:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:57,170 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-09-05 12:08:57,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-05 12:08:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-09-05 12:08:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-05 12:08:57,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:57,172 INFO L399 BasicCegarLoop]: trace histogram [128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:57,172 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1560312251, now seen corresponding path program 128 times [2019-09-05 12:08:57,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:57,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:57,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:02,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:02,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:02,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:09:02,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:09:02,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:02,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-05 12:09:02,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:02,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:02,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-05 12:09:02,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-05 12:09:02,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-05 12:09:02,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:09:02,884 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 131 states. [2019-09-05 12:09:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:03,611 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-09-05 12:09:03,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-05 12:09:03,611 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 266 [2019-09-05 12:09:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:03,612 INFO L225 Difference]: With dead ends: 275 [2019-09-05 12:09:03,612 INFO L226 Difference]: Without dead ends: 270 [2019-09-05 12:09:03,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:09:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-05 12:09:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-09-05 12:09:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-05 12:09:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-09-05 12:09:03,615 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2019-09-05 12:09:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:03,616 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-09-05 12:09:03,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-05 12:09:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-09-05 12:09:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-05 12:09:03,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:03,616 INFO L399 BasicCegarLoop]: trace histogram [129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:03,617 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:03,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1651847673, now seen corresponding path program 129 times [2019-09-05 12:09:03,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:03,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:03,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:09,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:09,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:09,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:09:09,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 130 check-sat command(s) [2019-09-05 12:09:09,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:09,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-05 12:09:09,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:09,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:09,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2019-09-05 12:09:09,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-05 12:09:09,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-05 12:09:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-05 12:09:09,530 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 132 states. [2019-09-05 12:09:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:09,925 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2019-09-05 12:09:09,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-05 12:09:09,925 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 268 [2019-09-05 12:09:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:09,926 INFO L225 Difference]: With dead ends: 277 [2019-09-05 12:09:09,926 INFO L226 Difference]: Without dead ends: 272 [2019-09-05 12:09:09,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-05 12:09:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-05 12:09:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-09-05 12:09:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-05 12:09:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-09-05 12:09:09,929 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2019-09-05 12:09:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:09,929 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-09-05 12:09:09,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-05 12:09:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-09-05 12:09:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-05 12:09:09,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:09,930 INFO L399 BasicCegarLoop]: trace histogram [130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:09,930 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:09,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:09,931 INFO L82 PathProgramCache]: Analyzing trace with hash -576925001, now seen corresponding path program 130 times [2019-09-05 12:09:09,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:09,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:09,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:15,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:15,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:15,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:09:15,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:09:15,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:15,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-05 12:09:15,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:15,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:15,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-05 12:09:15,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-05 12:09:15,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-05 12:09:15,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:09:15,781 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 133 states. [2019-09-05 12:09:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:16,284 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-09-05 12:09:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-05 12:09:16,284 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 270 [2019-09-05 12:09:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:16,285 INFO L225 Difference]: With dead ends: 279 [2019-09-05 12:09:16,285 INFO L226 Difference]: Without dead ends: 274 [2019-09-05 12:09:16,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:09:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-05 12:09:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-09-05 12:09:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-05 12:09:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-09-05 12:09:16,289 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2019-09-05 12:09:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:16,289 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-09-05 12:09:16,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-05 12:09:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-09-05 12:09:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-05 12:09:16,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:16,290 INFO L399 BasicCegarLoop]: trace histogram [131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:16,290 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:16,291 INFO L82 PathProgramCache]: Analyzing trace with hash 761215989, now seen corresponding path program 131 times [2019-09-05 12:09:16,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:16,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:16,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:16,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:16,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:22,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:22,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:22,117 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:09:22,322 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 132 check-sat command(s) [2019-09-05 12:09:22,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:22,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-05 12:09:22,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:22,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:22,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2019-09-05 12:09:22,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-05 12:09:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-05 12:09:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-05 12:09:22,384 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 134 states. [2019-09-05 12:09:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:22,902 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-09-05 12:09:22,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-05 12:09:22,903 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 272 [2019-09-05 12:09:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:22,904 INFO L225 Difference]: With dead ends: 281 [2019-09-05 12:09:22,904 INFO L226 Difference]: Without dead ends: 276 [2019-09-05 12:09:22,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-05 12:09:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-05 12:09:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2019-09-05 12:09:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-05 12:09:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2019-09-05 12:09:22,908 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2019-09-05 12:09:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:22,909 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2019-09-05 12:09:22,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-05 12:09:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2019-09-05 12:09:22,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-05 12:09:22,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:22,910 INFO L399 BasicCegarLoop]: trace histogram [132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:22,910 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:22,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1775481421, now seen corresponding path program 132 times [2019-09-05 12:09:22,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:22,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:22,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:28,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:28,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:28,827 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:09:29,026 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 133 check-sat command(s) [2019-09-05 12:09:29,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:29,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-05 12:09:29,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:29,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:29,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-05 12:09:29,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-05 12:09:29,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-05 12:09:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-05 12:09:29,101 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 135 states. [2019-09-05 12:09:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:29,749 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-09-05 12:09:29,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-05 12:09:29,750 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 274 [2019-09-05 12:09:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:29,751 INFO L225 Difference]: With dead ends: 283 [2019-09-05 12:09:29,751 INFO L226 Difference]: Without dead ends: 278 [2019-09-05 12:09:29,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-05 12:09:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-05 12:09:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-09-05 12:09:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-05 12:09:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-09-05 12:09:29,754 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2019-09-05 12:09:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:29,754 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-09-05 12:09:29,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-05 12:09:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-09-05 12:09:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-05 12:09:29,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:29,756 INFO L399 BasicCegarLoop]: trace histogram [133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:29,756 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:29,756 INFO L82 PathProgramCache]: Analyzing trace with hash -268303, now seen corresponding path program 133 times [2019-09-05 12:09:29,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:29,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:29,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:35,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:35,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:35,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:35,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-05 12:09:35,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:36,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:36,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 136 [2019-09-05 12:09:36,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-05 12:09:36,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-05 12:09:36,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-05 12:09:36,039 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 136 states. [2019-09-05 12:09:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:36,684 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-09-05 12:09:36,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-05 12:09:36,684 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 276 [2019-09-05 12:09:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:36,686 INFO L225 Difference]: With dead ends: 285 [2019-09-05 12:09:36,686 INFO L226 Difference]: Without dead ends: 280 [2019-09-05 12:09:36,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-05 12:09:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-05 12:09:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2019-09-05 12:09:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-05 12:09:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2019-09-05 12:09:36,692 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2019-09-05 12:09:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:36,692 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2019-09-05 12:09:36,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-05 12:09:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2019-09-05 12:09:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-05 12:09:36,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:36,694 INFO L399 BasicCegarLoop]: trace histogram [134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:36,694 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 877521583, now seen corresponding path program 134 times [2019-09-05 12:09:36,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:36,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:36,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:42,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:42,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:42,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:09:42,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:09:42,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:42,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-05 12:09:42,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:43,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:43,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-05 12:09:43,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-05 12:09:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-05 12:09:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-05 12:09:43,047 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 137 states. [2019-09-05 12:09:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:43,598 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-09-05 12:09:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-05 12:09:43,599 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 278 [2019-09-05 12:09:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:43,600 INFO L225 Difference]: With dead ends: 287 [2019-09-05 12:09:43,600 INFO L226 Difference]: Without dead ends: 282 [2019-09-05 12:09:43,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-05 12:09:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-05 12:09:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-09-05 12:09:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-05 12:09:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-09-05 12:09:43,605 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2019-09-05 12:09:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:43,605 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-09-05 12:09:43,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-05 12:09:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-09-05 12:09:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-05 12:09:43,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:43,606 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:43,606 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1674955283, now seen corresponding path program 135 times [2019-09-05 12:09:43,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:43,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:43,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:43,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:43,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:49,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:49,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:49,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:09:50,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2019-09-05 12:09:50,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:50,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-05 12:09:50,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:50,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:50,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 138 [2019-09-05 12:09:50,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-05 12:09:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-05 12:09:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-05 12:09:50,079 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 138 states. [2019-09-05 12:09:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:50,616 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2019-09-05 12:09:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-05 12:09:50,616 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 280 [2019-09-05 12:09:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:50,617 INFO L225 Difference]: With dead ends: 289 [2019-09-05 12:09:50,617 INFO L226 Difference]: Without dead ends: 284 [2019-09-05 12:09:50,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-05 12:09:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-05 12:09:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-09-05 12:09:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-05 12:09:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-09-05 12:09:50,620 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2019-09-05 12:09:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:50,621 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-09-05 12:09:50,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-05 12:09:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-09-05 12:09:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-05 12:09:50,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:50,622 INFO L399 BasicCegarLoop]: trace histogram [136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:50,622 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2116069803, now seen corresponding path program 136 times [2019-09-05 12:09:50,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:50,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:50,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:56,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:56,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 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:56,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:09:56,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:09:56,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:56,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-05 12:09:56,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:57,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:57,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-05 12:09:57,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-05 12:09:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-05 12:09:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-05 12:09:57,045 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 139 states. [2019-09-05 12:09:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:57,819 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-09-05 12:09:57,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-05 12:09:57,819 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 282 [2019-09-05 12:09:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:57,820 INFO L225 Difference]: With dead ends: 291 [2019-09-05 12:09:57,820 INFO L226 Difference]: Without dead ends: 286 [2019-09-05 12:09:57,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-05 12:09:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-05 12:09:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-09-05 12:09:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-05 12:09:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-09-05 12:09:57,824 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2019-09-05 12:09:57,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:57,825 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-09-05 12:09:57,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-05 12:09:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-09-05 12:09:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-05 12:09:57,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:57,826 INFO L399 BasicCegarLoop]: trace histogram [137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:57,826 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1136056855, now seen corresponding path program 137 times [2019-09-05 12:09:57,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:57,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:57,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:04,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:04,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:04,210 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:10:04,417 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 138 check-sat command(s) [2019-09-05 12:10:04,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:04,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-05 12:10:04,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (138)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:10:04,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:04,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2019-09-05 12:10:04,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-05 12:10:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-05 12:10:04,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-05 12:10:04,502 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 140 states. [2019-09-05 12:10:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:05,293 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2019-09-05 12:10:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-05 12:10:05,294 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 284 [2019-09-05 12:10:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:05,295 INFO L225 Difference]: With dead ends: 293 [2019-09-05 12:10:05,295 INFO L226 Difference]: Without dead ends: 288 [2019-09-05 12:10:05,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-05 12:10:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-05 12:10:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 287. [2019-09-05 12:10:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-05 12:10:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-09-05 12:10:05,298 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2019-09-05 12:10:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:05,298 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-09-05 12:10:05,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-05 12:10:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-09-05 12:10:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-05 12:10:05,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:05,299 INFO L399 BasicCegarLoop]: trace histogram [138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:05,299 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash 306416295, now seen corresponding path program 138 times [2019-09-05 12:10:05,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:05,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:05,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:05,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:05,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:11,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:11,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:11,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:10:12,110 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-09-05 12:10:12,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:12,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-05 12:10:12,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:12,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:12,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-05 12:10:12,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-05 12:10:12,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-05 12:10:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:10:12,178 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 141 states. [2019-09-05 12:10:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:13,036 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-09-05 12:10:13,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-05 12:10:13,036 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 286 [2019-09-05 12:10:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:13,037 INFO L225 Difference]: With dead ends: 295 [2019-09-05 12:10:13,037 INFO L226 Difference]: Without dead ends: 290 [2019-09-05 12:10:13,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:10:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-05 12:10:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-09-05 12:10:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-05 12:10:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-09-05 12:10:13,042 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2019-09-05 12:10:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:13,042 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-09-05 12:10:13,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-05 12:10:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-09-05 12:10:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-05 12:10:13,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:13,044 INFO L399 BasicCegarLoop]: trace histogram [139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:13,044 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:13,044 INFO L82 PathProgramCache]: Analyzing trace with hash -751323163, now seen corresponding path program 139 times [2019-09-05 12:10:13,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:13,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:13,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:13,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:13,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:19,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:19,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:19,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:19,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-05 12:10:19,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:19,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:19,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 142 [2019-09-05 12:10:19,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-05 12:10:19,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-05 12:10:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-05 12:10:19,785 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 142 states. [2019-09-05 12:10:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:20,329 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-09-05 12:10:20,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-05 12:10:20,329 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 288 [2019-09-05 12:10:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:20,330 INFO L225 Difference]: With dead ends: 297 [2019-09-05 12:10:20,331 INFO L226 Difference]: Without dead ends: 292 [2019-09-05 12:10:20,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-05 12:10:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-05 12:10:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-09-05 12:10:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-05 12:10:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-09-05 12:10:20,336 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2019-09-05 12:10:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:20,336 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-09-05 12:10:20,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-05 12:10:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-09-05 12:10:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-05 12:10:20,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:20,337 INFO L399 BasicCegarLoop]: trace histogram [140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:20,337 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 668306851, now seen corresponding path program 140 times [2019-09-05 12:10:20,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:20,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:20,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:20,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:20,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:26,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:26,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:26,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:10:27,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:10:27,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:27,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-05 12:10:27,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:27,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:27,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-05 12:10:27,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-05 12:10:27,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-05 12:10:27,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-05 12:10:27,093 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 143 states. [2019-09-05 12:10:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:28,044 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-09-05 12:10:28,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-05 12:10:28,044 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 290 [2019-09-05 12:10:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:28,045 INFO L225 Difference]: With dead ends: 299 [2019-09-05 12:10:28,045 INFO L226 Difference]: Without dead ends: 294 [2019-09-05 12:10:28,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-05 12:10:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-05 12:10:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-09-05 12:10:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-05 12:10:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-09-05 12:10:28,048 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2019-09-05 12:10:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:28,048 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-09-05 12:10:28,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-05 12:10:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-09-05 12:10:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-05 12:10:28,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:28,050 INFO L399 BasicCegarLoop]: trace histogram [141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:28,050 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash -866849823, now seen corresponding path program 141 times [2019-09-05 12:10:28,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:28,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:28,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:28,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:28,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:34,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:34,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:34,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:10:35,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 142 check-sat command(s) [2019-09-05 12:10:35,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:35,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-05 12:10:35,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:35,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:35,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 144 [2019-09-05 12:10:35,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-05 12:10:35,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-05 12:10:35,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-05 12:10:35,124 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 144 states. [2019-09-05 12:10:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:35,916 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-09-05 12:10:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-05 12:10:35,916 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 292 [2019-09-05 12:10:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:35,917 INFO L225 Difference]: With dead ends: 301 [2019-09-05 12:10:35,917 INFO L226 Difference]: Without dead ends: 296 [2019-09-05 12:10:35,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-05 12:10:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-05 12:10:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-09-05 12:10:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-05 12:10:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-09-05 12:10:35,922 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2019-09-05 12:10:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:35,923 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-09-05 12:10:35,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-05 12:10:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-09-05 12:10:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-05 12:10:35,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:35,924 INFO L399 BasicCegarLoop]: trace histogram [142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:35,924 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1316336287, now seen corresponding path program 142 times [2019-09-05 12:10:35,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:35,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:35,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:35,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:35,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:42,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:42,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:42,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:10:42,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:10:42,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:42,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-05 12:10:42,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:42,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:42,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-05 12:10:42,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-05 12:10:42,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-05 12:10:42,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-05 12:10:42,852 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 145 states. [2019-09-05 12:10:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:43,840 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-09-05 12:10:43,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-05 12:10:43,840 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 294 [2019-09-05 12:10:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:43,841 INFO L225 Difference]: With dead ends: 303 [2019-09-05 12:10:43,841 INFO L226 Difference]: Without dead ends: 298 [2019-09-05 12:10:43,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-05 12:10:43,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-05 12:10:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-09-05 12:10:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-05 12:10:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-09-05 12:10:43,845 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2019-09-05 12:10:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:43,845 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-09-05 12:10:43,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-05 12:10:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-09-05 12:10:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-05 12:10:43,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:43,846 INFO L399 BasicCegarLoop]: trace histogram [143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:43,847 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash -880819747, now seen corresponding path program 143 times [2019-09-05 12:10:43,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:43,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:43,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:43,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:50,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:50,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:50,751 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:10:50,969 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2019-09-05 12:10:50,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:50,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-05 12:10:50,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:51,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:51,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2019-09-05 12:10:51,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-05 12:10:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-05 12:10:51,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-05 12:10:51,042 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 146 states. [2019-09-05 12:10:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:51,872 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-09-05 12:10:51,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-05 12:10:51,872 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 296 [2019-09-05 12:10:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:51,874 INFO L225 Difference]: With dead ends: 305 [2019-09-05 12:10:51,874 INFO L226 Difference]: Without dead ends: 300 [2019-09-05 12:10:51,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-05 12:10:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-05 12:10:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2019-09-05 12:10:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-05 12:10:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-09-05 12:10:51,879 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2019-09-05 12:10:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:51,879 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2019-09-05 12:10:51,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-05 12:10:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2019-09-05 12:10:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-05 12:10:51,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:51,880 INFO L399 BasicCegarLoop]: trace histogram [144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:51,880 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash 776141211, now seen corresponding path program 144 times [2019-09-05 12:10:51,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:51,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:51,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:51,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:51,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:58,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:58,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:58,890 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:10:59,117 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2019-09-05 12:10:59,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:59,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-05 12:10:59,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:59,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:59,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-05 12:10:59,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-05 12:10:59,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-05 12:10:59,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-05 12:10:59,192 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 147 states. [2019-09-05 12:11:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:00,247 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-09-05 12:11:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-05 12:11:00,247 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 298 [2019-09-05 12:11:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:00,248 INFO L225 Difference]: With dead ends: 307 [2019-09-05 12:11:00,248 INFO L226 Difference]: Without dead ends: 302 [2019-09-05 12:11:00,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-05 12:11:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-05 12:11:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-09-05 12:11:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-05 12:11:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-09-05 12:11:00,253 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2019-09-05 12:11:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:00,254 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-09-05 12:11:00,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-05 12:11:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-09-05 12:11:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-05 12:11:00,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:00,255 INFO L399 BasicCegarLoop]: trace histogram [145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:00,256 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash -317244967, now seen corresponding path program 145 times [2019-09-05 12:11:00,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:00,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:00,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:07,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:07,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:07,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:07,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-05 12:11:07,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:07,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 148 [2019-09-05 12:11:07,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-05 12:11:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-05 12:11:07,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-05 12:11:07,617 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 148 states. [2019-09-05 12:11:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:08,210 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2019-09-05 12:11:08,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-05 12:11:08,211 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 300 [2019-09-05 12:11:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:08,212 INFO L225 Difference]: With dead ends: 309 [2019-09-05 12:11:08,212 INFO L226 Difference]: Without dead ends: 304 [2019-09-05 12:11:08,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-05 12:11:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-05 12:11:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2019-09-05 12:11:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-05 12:11:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-09-05 12:11:08,217 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2019-09-05 12:11:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:08,217 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2019-09-05 12:11:08,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-05 12:11:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2019-09-05 12:11:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-05 12:11:08,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:08,218 INFO L399 BasicCegarLoop]: trace histogram [146, 146, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:08,219 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1205625495, now seen corresponding path program 146 times [2019-09-05 12:11:08,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:08,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:08,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:15,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:15,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:15,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:11:15,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:11:15,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:15,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-05 12:11:15,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:15,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:15,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-05 12:11:15,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-05 12:11:15,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-05 12:11:15,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-05 12:11:15,607 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 149 states. [2019-09-05 12:11:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:16,657 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-09-05 12:11:16,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-05 12:11:16,658 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 302 [2019-09-05 12:11:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:16,658 INFO L225 Difference]: With dead ends: 311 [2019-09-05 12:11:16,658 INFO L226 Difference]: Without dead ends: 306 [2019-09-05 12:11:16,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-05 12:11:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-05 12:11:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-09-05 12:11:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-05 12:11:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-09-05 12:11:16,662 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2019-09-05 12:11:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:16,662 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-09-05 12:11:16,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-05 12:11:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-09-05 12:11:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-05 12:11:16,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:16,663 INFO L399 BasicCegarLoop]: trace histogram [147, 147, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:16,663 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:16,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:16,664 INFO L82 PathProgramCache]: Analyzing trace with hash 100291541, now seen corresponding path program 147 times [2019-09-05 12:11:16,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:16,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:16,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:16,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:16,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:24,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:24,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:24,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:11:24,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 148 check-sat command(s) [2019-09-05 12:11:24,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:24,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-05 12:11:24,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:24,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:24,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 150 [2019-09-05 12:11:24,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-05 12:11:24,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-05 12:11:24,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-05 12:11:24,333 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 150 states. [2019-09-05 12:11:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:25,436 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2019-09-05 12:11:25,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-05 12:11:25,436 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 304 [2019-09-05 12:11:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:25,437 INFO L225 Difference]: With dead ends: 313 [2019-09-05 12:11:25,437 INFO L226 Difference]: Without dead ends: 308 [2019-09-05 12:11:25,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-05 12:11:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-05 12:11:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2019-09-05 12:11:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-05 12:11:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-09-05 12:11:25,441 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2019-09-05 12:11:25,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:25,441 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-09-05 12:11:25,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-05 12:11:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-09-05 12:11:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-05 12:11:25,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:25,442 INFO L399 BasicCegarLoop]: trace histogram [148, 148, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:25,442 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1268716141, now seen corresponding path program 148 times [2019-09-05 12:11:25,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:25,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:32,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:32,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:32,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:11:32,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:11:32,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:32,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-05 12:11:32,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (149)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:11:33,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:33,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2019-09-05 12:11:33,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-05 12:11:33,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-05 12:11:33,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-05 12:11:33,129 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 151 states. [2019-09-05 12:11:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:34,025 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-09-05 12:11:34,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-05 12:11:34,025 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 306 [2019-09-05 12:11:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:34,026 INFO L225 Difference]: With dead ends: 315 [2019-09-05 12:11:34,026 INFO L226 Difference]: Without dead ends: 310 [2019-09-05 12:11:34,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-05 12:11:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-05 12:11:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-09-05 12:11:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-05 12:11:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-09-05 12:11:34,030 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2019-09-05 12:11:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:34,030 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-09-05 12:11:34,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-05 12:11:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-09-05 12:11:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-05 12:11:34,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:34,031 INFO L399 BasicCegarLoop]: trace histogram [149, 149, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:34,031 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:34,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1669861329, now seen corresponding path program 149 times [2019-09-05 12:11:34,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:34,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:34,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:34,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:34,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:41,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:41,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:41,526 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:11:41,762 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 150 check-sat command(s) [2019-09-05 12:11:41,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:41,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-05 12:11:41,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:41,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:41,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 152 [2019-09-05 12:11:41,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-09-05 12:11:41,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-09-05 12:11:41,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-05 12:11:41,854 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 152 states. [2019-09-05 12:11:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:42,471 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2019-09-05 12:11:42,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-05 12:11:42,471 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 308 [2019-09-05 12:11:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:42,472 INFO L225 Difference]: With dead ends: 317 [2019-09-05 12:11:42,472 INFO L226 Difference]: Without dead ends: 312 [2019-09-05 12:11:42,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-05 12:11:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-05 12:11:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 311. [2019-09-05 12:11:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-05 12:11:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-09-05 12:11:42,477 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2019-09-05 12:11:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:42,477 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-09-05 12:11:42,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-09-05 12:11:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-09-05 12:11:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-05 12:11:42,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:42,479 INFO L399 BasicCegarLoop]: trace histogram [150, 150, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:42,479 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash -445670769, now seen corresponding path program 150 times [2019-09-05 12:11:42,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:42,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:42,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:50,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:50,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:50,298 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:11:50,543 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) [2019-09-05 12:11:50,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:50,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-05 12:11:50,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:50,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:50,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2019-09-05 12:11:50,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-05 12:11:50,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-05 12:11:50,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:11:50,634 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 153 states. [2019-09-05 12:11:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:51,319 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-09-05 12:11:51,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-05 12:11:51,319 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 310 [2019-09-05 12:11:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:51,320 INFO L225 Difference]: With dead ends: 319 [2019-09-05 12:11:51,320 INFO L226 Difference]: Without dead ends: 314 [2019-09-05 12:11:51,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:11:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-05 12:11:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-09-05 12:11:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-05 12:11:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-09-05 12:11:51,326 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2019-09-05 12:11:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:51,327 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-09-05 12:11:51,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-05 12:11:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-09-05 12:11:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-05 12:11:51,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:51,328 INFO L399 BasicCegarLoop]: trace histogram [151, 151, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:51,328 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1952485939, now seen corresponding path program 151 times [2019-09-05 12:11:51,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:51,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:51,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:51,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:59,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:59,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:59,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:59,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-05 12:11:59,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:59,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:59,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 154] total 154 [2019-09-05 12:11:59,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-05 12:11:59,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-05 12:11:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 12:11:59,164 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 154 states. [2019-09-05 12:11:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:59,945 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-09-05 12:11:59,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-05 12:11:59,945 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 312 [2019-09-05 12:11:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:59,946 INFO L225 Difference]: With dead ends: 321 [2019-09-05 12:11:59,946 INFO L226 Difference]: Without dead ends: 316 [2019-09-05 12:11:59,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 12:11:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-05 12:11:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2019-09-05 12:11:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-05 12:11:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2019-09-05 12:11:59,951 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2019-09-05 12:11:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:59,951 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2019-09-05 12:11:59,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-05 12:11:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2019-09-05 12:11:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-05 12:11:59,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:59,952 INFO L399 BasicCegarLoop]: trace histogram [152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:59,952 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1697081739, now seen corresponding path program 152 times [2019-09-05 12:11:59,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:59,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:59,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:59,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:07,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:07,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:07,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:12:07,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:12:07,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:07,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-05 12:12:07,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:07,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:07,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2019-09-05 12:12:07,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-05 12:12:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-05 12:12:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-09-05 12:12:07,854 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 155 states. [2019-09-05 12:12:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:08,794 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-09-05 12:12:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-05 12:12:08,795 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 314 [2019-09-05 12:12:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:08,796 INFO L225 Difference]: With dead ends: 323 [2019-09-05 12:12:08,796 INFO L226 Difference]: Without dead ends: 318 [2019-09-05 12:12:08,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-09-05 12:12:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-05 12:12:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-09-05 12:12:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-05 12:12:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-09-05 12:12:08,802 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2019-09-05 12:12:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:08,803 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-09-05 12:12:08,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-05 12:12:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-09-05 12:12:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-05 12:12:08,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:08,804 INFO L399 BasicCegarLoop]: trace histogram [153, 153, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:08,805 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash -56660535, now seen corresponding path program 153 times [2019-09-05 12:12:08,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:08,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:08,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:16,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:16,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:16,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:12:17,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 154 check-sat command(s) [2019-09-05 12:12:17,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:17,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-05 12:12:17,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:17,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:17,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 156] total 156 [2019-09-05 12:12:17,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-05 12:12:17,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-05 12:12:17,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-05 12:12:17,155 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 156 states. [2019-09-05 12:12:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:17,988 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-09-05 12:12:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-05 12:12:17,989 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 316 [2019-09-05 12:12:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:17,990 INFO L225 Difference]: With dead ends: 325 [2019-09-05 12:12:17,990 INFO L226 Difference]: Without dead ends: 320 [2019-09-05 12:12:17,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-05 12:12:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-05 12:12:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-09-05 12:12:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-05 12:12:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2019-09-05 12:12:17,995 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2019-09-05 12:12:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:17,995 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2019-09-05 12:12:17,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-05 12:12:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2019-09-05 12:12:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-05 12:12:17,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:17,996 INFO L399 BasicCegarLoop]: trace histogram [154, 154, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:17,996 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:17,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:17,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1775805817, now seen corresponding path program 154 times [2019-09-05 12:12:17,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:17,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:17,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:17,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:17,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:25,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:25,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:25,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:12:26,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:12:26,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:26,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-05 12:12:26,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:26,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:26,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2019-09-05 12:12:26,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-05 12:12:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-05 12:12:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-09-05 12:12:26,117 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 157 states. [2019-09-05 12:12:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:26,806 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-09-05 12:12:26,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-05 12:12:26,807 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 318 [2019-09-05 12:12:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:26,808 INFO L225 Difference]: With dead ends: 327 [2019-09-05 12:12:26,808 INFO L226 Difference]: Without dead ends: 322 [2019-09-05 12:12:26,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-09-05 12:12:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-05 12:12:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-09-05 12:12:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-05 12:12:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-09-05 12:12:26,812 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2019-09-05 12:12:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:26,812 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-09-05 12:12:26,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-05 12:12:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-09-05 12:12:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-05 12:12:26,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:26,814 INFO L399 BasicCegarLoop]: trace histogram [155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:26,814 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash -312012859, now seen corresponding path program 155 times [2019-09-05 12:12:26,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:26,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:26,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:26,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:26,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:34,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:34,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:34,954 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:12:35,185 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2019-09-05 12:12:35,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:35,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-05 12:12:35,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:35,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:35,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158, 158] total 158 [2019-09-05 12:12:35,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-09-05 12:12:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-09-05 12:12:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-05 12:12:35,265 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 158 states. [2019-09-05 12:12:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:36,045 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2019-09-05 12:12:36,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-05 12:12:36,046 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 320 [2019-09-05 12:12:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:36,047 INFO L225 Difference]: With dead ends: 329 [2019-09-05 12:12:36,047 INFO L226 Difference]: Without dead ends: 324 [2019-09-05 12:12:36,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-05 12:12:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-05 12:12:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2019-09-05 12:12:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-05 12:12:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2019-09-05 12:12:36,053 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2019-09-05 12:12:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:36,053 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2019-09-05 12:12:36,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-09-05 12:12:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2019-09-05 12:12:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-05 12:12:36,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:36,055 INFO L399 BasicCegarLoop]: trace histogram [156, 156, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:36,055 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1938713987, now seen corresponding path program 156 times [2019-09-05 12:12:36,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:36,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:36,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:44,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:44,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:44,341 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:12:44,590 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 157 check-sat command(s) [2019-09-05 12:12:44,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:44,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-05 12:12:44,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 159 [2019-09-05 12:12:44,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-05 12:12:44,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-05 12:12:44,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-09-05 12:12:44,673 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 159 states. [2019-09-05 12:12:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:45,887 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-09-05 12:12:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-05 12:12:45,888 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 322 [2019-09-05 12:12:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:45,888 INFO L225 Difference]: With dead ends: 331 [2019-09-05 12:12:45,888 INFO L226 Difference]: Without dead ends: 326 [2019-09-05 12:12:45,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-09-05 12:12:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-05 12:12:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-09-05 12:12:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-05 12:12:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-09-05 12:12:45,892 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2019-09-05 12:12:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:45,893 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-09-05 12:12:45,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-05 12:12:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-09-05 12:12:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-05 12:12:45,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:45,894 INFO L399 BasicCegarLoop]: trace histogram [157, 157, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:45,894 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash 223695809, now seen corresponding path program 157 times [2019-09-05 12:12:45,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:45,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:45,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:45,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:45,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:54,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:54,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:54,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:12:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:54,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-05 12:12:54,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:54,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:54,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160, 160] total 160 [2019-09-05 12:12:54,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-05 12:12:54,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-05 12:12:54,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-09-05 12:12:54,397 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 160 states. [2019-09-05 12:12:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:55,648 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2019-09-05 12:12:55,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-05 12:12:55,648 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 324 [2019-09-05 12:12:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:55,649 INFO L225 Difference]: With dead ends: 333 [2019-09-05 12:12:55,649 INFO L226 Difference]: Without dead ends: 328 [2019-09-05 12:12:55,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-09-05 12:12:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-05 12:12:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2019-09-05 12:12:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-05 12:12:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-09-05 12:12:55,654 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2019-09-05 12:12:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:55,654 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-09-05 12:12:55,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-05 12:12:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-09-05 12:12:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-05 12:12:55,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:55,655 INFO L399 BasicCegarLoop]: trace histogram [158, 158, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:55,656 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1358668415, now seen corresponding path program 158 times [2019-09-05 12:12:55,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:55,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:55,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:12:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:04,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:04,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:13:04,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:13:04,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:04,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-05 12:13:04,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:04,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:04,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 161 [2019-09-05 12:13:04,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-05 12:13:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-05 12:13:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:13:04,309 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 161 states. [2019-09-05 12:13:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:05,382 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-09-05 12:13:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-05 12:13:05,383 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 326 [2019-09-05 12:13:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:05,384 INFO L225 Difference]: With dead ends: 335 [2019-09-05 12:13:05,384 INFO L226 Difference]: Without dead ends: 330 [2019-09-05 12:13:05,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:13:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-05 12:13:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-09-05 12:13:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-05 12:13:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-09-05 12:13:05,389 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2019-09-05 12:13:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:05,390 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-09-05 12:13:05,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-05 12:13:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-09-05 12:13:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-05 12:13:05,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:05,391 INFO L399 BasicCegarLoop]: trace histogram [159, 159, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:05,391 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1145649597, now seen corresponding path program 159 times [2019-09-05 12:13:05,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:05,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:05,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:13,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:13,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:14,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:13:14,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 160 check-sat command(s) [2019-09-05 12:13:14,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:14,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-05 12:13:14,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:14,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:14,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162, 162] total 162 [2019-09-05 12:13:14,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-05 12:13:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-05 12:13:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-09-05 12:13:14,375 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 162 states. [2019-09-05 12:13:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:15,283 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2019-09-05 12:13:15,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-09-05 12:13:15,283 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 328 [2019-09-05 12:13:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:15,284 INFO L225 Difference]: With dead ends: 337 [2019-09-05 12:13:15,284 INFO L226 Difference]: Without dead ends: 332 [2019-09-05 12:13:15,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-09-05 12:13:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-05 12:13:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2019-09-05 12:13:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-05 12:13:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-09-05 12:13:15,289 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2019-09-05 12:13:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:15,289 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-09-05 12:13:15,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-05 12:13:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-09-05 12:13:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-05 12:13:15,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:15,290 INFO L399 BasicCegarLoop]: trace histogram [160, 160, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:15,290 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1701971589, now seen corresponding path program 160 times [2019-09-05 12:13:15,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:15,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:15,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:23,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:23,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:23,994 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:13:24,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:13:24,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:24,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-05 12:13:24,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:24,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:24,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 163 [2019-09-05 12:13:24,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-05 12:13:24,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-05 12:13:24,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:13:24,145 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 163 states. [2019-09-05 12:13:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:25,544 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-09-05 12:13:25,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-05 12:13:25,545 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 330 [2019-09-05 12:13:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:25,545 INFO L225 Difference]: With dead ends: 339 [2019-09-05 12:13:25,545 INFO L226 Difference]: Without dead ends: 334 [2019-09-05 12:13:25,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:13:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-05 12:13:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-09-05 12:13:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-05 12:13:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-09-05 12:13:25,550 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2019-09-05 12:13:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:25,551 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-09-05 12:13:25,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-05 12:13:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-09-05 12:13:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-05 12:13:25,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:25,552 INFO L399 BasicCegarLoop]: trace histogram [161, 161, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:25,553 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1923203513, now seen corresponding path program 161 times [2019-09-05 12:13:25,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:25,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:25,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:34,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:34,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:34,386 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:13:34,662 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 162 check-sat command(s) [2019-09-05 12:13:34,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:34,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-05 12:13:34,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:34,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:34,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164, 164] total 164 [2019-09-05 12:13:34,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-09-05 12:13:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-09-05 12:13:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-09-05 12:13:34,771 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 164 states. [2019-09-05 12:13:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:35,496 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-09-05 12:13:35,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-05 12:13:35,497 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 332 [2019-09-05 12:13:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:35,497 INFO L225 Difference]: With dead ends: 341 [2019-09-05 12:13:35,497 INFO L226 Difference]: Without dead ends: 336 [2019-09-05 12:13:35,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-09-05 12:13:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-05 12:13:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2019-09-05 12:13:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-05 12:13:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2019-09-05 12:13:35,501 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2019-09-05 12:13:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:35,501 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2019-09-05 12:13:35,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-09-05 12:13:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2019-09-05 12:13:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-05 12:13:35,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:35,503 INFO L399 BasicCegarLoop]: trace histogram [162, 162, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:35,503 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1796967817, now seen corresponding path program 162 times [2019-09-05 12:13:35,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:35,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:35,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:44,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:44,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:44,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:13:44,630 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 163 check-sat command(s) [2019-09-05 12:13:44,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:44,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-05 12:13:44,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:44,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:44,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 165 [2019-09-05 12:13:44,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-05 12:13:44,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-05 12:13:44,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-09-05 12:13:44,720 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 165 states. [2019-09-05 12:13:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:46,379 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-09-05 12:13:46,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-05 12:13:46,379 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 334 [2019-09-05 12:13:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:46,380 INFO L225 Difference]: With dead ends: 343 [2019-09-05 12:13:46,380 INFO L226 Difference]: Without dead ends: 338 [2019-09-05 12:13:46,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-09-05 12:13:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-05 12:13:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-09-05 12:13:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-05 12:13:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-09-05 12:13:46,384 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2019-09-05 12:13:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:46,384 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-09-05 12:13:46,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-05 12:13:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-09-05 12:13:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-05 12:13:46,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:46,386 INFO L399 BasicCegarLoop]: trace histogram [163, 163, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:46,386 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:46,387 INFO L82 PathProgramCache]: Analyzing trace with hash 826141621, now seen corresponding path program 163 times [2019-09-05 12:13:46,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:46,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:46,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:55,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:55,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:55,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:13:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:55,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-05 12:13:55,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:55,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:55,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166, 166] total 166 [2019-09-05 12:13:55,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-05 12:13:55,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-05 12:13:55,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-09-05 12:13:55,573 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 166 states. [2019-09-05 12:13:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:56,311 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-09-05 12:13:56,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-09-05 12:13:56,311 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 336 [2019-09-05 12:13:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:56,312 INFO L225 Difference]: With dead ends: 345 [2019-09-05 12:13:56,312 INFO L226 Difference]: Without dead ends: 340 [2019-09-05 12:13:56,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-09-05 12:13:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-05 12:13:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-09-05 12:13:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-05 12:13:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2019-09-05 12:13:56,318 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2019-09-05 12:13:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:56,318 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2019-09-05 12:13:56,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-05 12:13:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2019-09-05 12:13:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-05 12:13:56,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:56,319 INFO L399 BasicCegarLoop]: trace histogram [164, 164, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:56,319 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 488508787, now seen corresponding path program 164 times [2019-09-05 12:13:56,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:56,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:56,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:13:56,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:05,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:05,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:05,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:14:05,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:14:05,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:05,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-05 12:14:05,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:05,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:05,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 167 [2019-09-05 12:14:05,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-05 12:14:05,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-05 12:14:05,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-09-05 12:14:05,525 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 167 states. [2019-09-05 12:14:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:06,873 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-09-05 12:14:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-05 12:14:06,874 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 338 [2019-09-05 12:14:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:06,875 INFO L225 Difference]: With dead ends: 347 [2019-09-05 12:14:06,875 INFO L226 Difference]: Without dead ends: 342 [2019-09-05 12:14:06,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-09-05 12:14:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-05 12:14:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-09-05 12:14:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-05 12:14:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-09-05 12:14:06,878 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2019-09-05 12:14:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:06,878 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-09-05 12:14:06,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-05 12:14:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-09-05 12:14:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-05 12:14:06,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:06,880 INFO L399 BasicCegarLoop]: trace histogram [165, 165, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:06,880 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1854097487, now seen corresponding path program 165 times [2019-09-05 12:14:06,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:06,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:06,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:16,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:16,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:16,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:14:16,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 166 check-sat command(s) [2019-09-05 12:14:16,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:16,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-05 12:14:16,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:16,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:16,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168, 168] total 168 [2019-09-05 12:14:16,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-05 12:14:16,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-05 12:14:16,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 12:14:16,493 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 168 states. [2019-09-05 12:14:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:17,585 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2019-09-05 12:14:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-09-05 12:14:17,586 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 340 [2019-09-05 12:14:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:17,587 INFO L225 Difference]: With dead ends: 349 [2019-09-05 12:14:17,587 INFO L226 Difference]: Without dead ends: 344 [2019-09-05 12:14:17,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 12:14:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-05 12:14:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2019-09-05 12:14:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-05 12:14:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2019-09-05 12:14:17,591 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2019-09-05 12:14:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:17,591 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2019-09-05 12:14:17,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-05 12:14:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2019-09-05 12:14:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-05 12:14:17,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:17,592 INFO L399 BasicCegarLoop]: trace histogram [166, 166, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:17,592 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1759103599, now seen corresponding path program 166 times [2019-09-05 12:14:17,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:17,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:17,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:17,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:17,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:26,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:26,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:14:27,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:27,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:14:27,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:27,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-05 12:14:27,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:27,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:27,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 169 [2019-09-05 12:14:27,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-05 12:14:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-05 12:14:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-09-05 12:14:27,161 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 169 states. [2019-09-05 12:14:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:27,944 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-09-05 12:14:27,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-05 12:14:27,944 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 342 [2019-09-05 12:14:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:27,945 INFO L225 Difference]: With dead ends: 351 [2019-09-05 12:14:27,945 INFO L226 Difference]: Without dead ends: 346 [2019-09-05 12:14:27,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-09-05 12:14:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-05 12:14:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-09-05 12:14:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-05 12:14:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-09-05 12:14:27,949 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2019-09-05 12:14:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:27,949 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-09-05 12:14:27,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-05 12:14:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-09-05 12:14:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-05 12:14:27,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:27,950 INFO L399 BasicCegarLoop]: trace histogram [167, 167, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:27,950 INFO L418 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:27,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash -583195219, now seen corresponding path program 167 times [2019-09-05 12:14:27,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:27,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:27,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:37,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:37,355 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:14:37,635 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 168 check-sat command(s) [2019-09-05 12:14:37,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:37,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-05 12:14:37,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:37,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:37,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170, 170] total 170 [2019-09-05 12:14:37,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-09-05 12:14:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-09-05 12:14:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-09-05 12:14:37,732 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 170 states. [2019-09-05 12:14:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:39,073 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2019-09-05 12:14:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-09-05 12:14:39,074 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 344 [2019-09-05 12:14:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:39,074 INFO L225 Difference]: With dead ends: 353 [2019-09-05 12:14:39,074 INFO L226 Difference]: Without dead ends: 348 [2019-09-05 12:14:39,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-09-05 12:14:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-05 12:14:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2019-09-05 12:14:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-05 12:14:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-09-05 12:14:39,078 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2019-09-05 12:14:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:39,079 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-09-05 12:14:39,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-09-05 12:14:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-09-05 12:14:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-05 12:14:39,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:39,080 INFO L399 BasicCegarLoop]: trace histogram [168, 168, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:39,080 INFO L418 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash -969496213, now seen corresponding path program 168 times [2019-09-05 12:14:39,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:39,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:39,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:48,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:48,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:48,673 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:14:48,963 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 169 check-sat command(s) [2019-09-05 12:14:48,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:48,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-05 12:14:48,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:14:49,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 171 [2019-09-05 12:14:49,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-05 12:14:49,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-05 12:14:49,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-09-05 12:14:49,055 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 171 states. [2019-09-05 12:14:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:50,747 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-09-05 12:14:50,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-05 12:14:50,748 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 346 [2019-09-05 12:14:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:50,748 INFO L225 Difference]: With dead ends: 355 [2019-09-05 12:14:50,748 INFO L226 Difference]: Without dead ends: 350 [2019-09-05 12:14:50,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-09-05 12:14:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-05 12:14:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-09-05 12:14:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-05 12:14:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-09-05 12:14:50,752 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2019-09-05 12:14:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:50,753 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-09-05 12:14:50,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-05 12:14:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-09-05 12:14:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-05 12:14:50,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:50,754 INFO L399 BasicCegarLoop]: trace histogram [169, 169, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:50,754 INFO L418 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:50,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1457403305, now seen corresponding path program 169 times [2019-09-05 12:14:50,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:50,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:50,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:50,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:50,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:00,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:00,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:00,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:15:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:00,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 171 conjunts are in the unsatisfiable core [2019-09-05 12:15:00,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:00,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:00,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172, 172] total 172 [2019-09-05 12:15:00,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-05 12:15:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-05 12:15:00,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-09-05 12:15:00,529 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 172 states. [2019-09-05 12:15:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:02,104 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2019-09-05 12:15:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-05 12:15:02,104 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 348 [2019-09-05 12:15:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:02,105 INFO L225 Difference]: With dead ends: 357 [2019-09-05 12:15:02,105 INFO L226 Difference]: Without dead ends: 352 [2019-09-05 12:15:02,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-09-05 12:15:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-05 12:15:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-09-05 12:15:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-05 12:15:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-09-05 12:15:02,110 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2019-09-05 12:15:02,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:02,110 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-09-05 12:15:02,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-05 12:15:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-09-05 12:15:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-05 12:15:02,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:02,112 INFO L399 BasicCegarLoop]: trace histogram [170, 170, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:02,112 INFO L418 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1540598375, now seen corresponding path program 170 times [2019-09-05 12:15:02,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:02,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:02,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:02,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:15:02,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:11,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:11,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:11,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:15:11,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:15:11,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:11,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 172 conjunts are in the unsatisfiable core [2019-09-05 12:15:11,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:11,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:11,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173, 173] total 173 [2019-09-05 12:15:11,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 173 states [2019-09-05 12:15:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2019-09-05 12:15:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-09-05 12:15:11,977 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 173 states. [2019-09-05 12:15:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:13,155 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-09-05 12:15:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-09-05 12:15:13,155 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 350 [2019-09-05 12:15:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:13,156 INFO L225 Difference]: With dead ends: 359 [2019-09-05 12:15:13,156 INFO L226 Difference]: Without dead ends: 354 [2019-09-05 12:15:13,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-09-05 12:15:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-05 12:15:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-09-05 12:15:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-05 12:15:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-09-05 12:15:13,160 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2019-09-05 12:15:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:13,160 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-09-05 12:15:13,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 173 states. [2019-09-05 12:15:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-09-05 12:15:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-05 12:15:13,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:13,161 INFO L399 BasicCegarLoop]: trace histogram [171, 171, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:13,162 INFO L418 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash -113317979, now seen corresponding path program 171 times [2019-09-05 12:15:13,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:13,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:13,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:13,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:13,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:22,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:22,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:22,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:15:23,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 172 check-sat command(s) [2019-09-05 12:15:23,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:23,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-05 12:15:23,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:23,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:23,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174, 174] total 174 [2019-09-05 12:15:23,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-05 12:15:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-05 12:15:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-09-05 12:15:23,430 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 174 states. [2019-09-05 12:15:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:24,460 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-09-05 12:15:24,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-09-05 12:15:24,460 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 352 [2019-09-05 12:15:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:24,461 INFO L225 Difference]: With dead ends: 361 [2019-09-05 12:15:24,461 INFO L226 Difference]: Without dead ends: 356 [2019-09-05 12:15:24,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-09-05 12:15:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-05 12:15:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2019-09-05 12:15:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-05 12:15:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2019-09-05 12:15:24,465 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2019-09-05 12:15:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:24,465 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2019-09-05 12:15:24,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-05 12:15:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2019-09-05 12:15:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-05 12:15:24,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:24,467 INFO L399 BasicCegarLoop]: trace histogram [172, 172, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:24,467 INFO L418 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:24,467 INFO L82 PathProgramCache]: Analyzing trace with hash -389034653, now seen corresponding path program 172 times [2019-09-05 12:15:24,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:24,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:24,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:24,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:24,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 29584 backedges. 0 proven. 29584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:34,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:34,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:34,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:15:34,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:15:34,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:34,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 174 conjunts are in the unsatisfiable core [2019-09-05 12:15:34,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 29584 backedges. 0 proven. 29584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:34,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:34,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175, 175] total 175 [2019-09-05 12:15:34,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 175 states [2019-09-05 12:15:34,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2019-09-05 12:15:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2019-09-05 12:15:34,484 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 175 states. [2019-09-05 12:15:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:35,587 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-09-05 12:15:35,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-05 12:15:35,587 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 354 [2019-09-05 12:15:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:35,588 INFO L225 Difference]: With dead ends: 363 [2019-09-05 12:15:35,588 INFO L226 Difference]: Without dead ends: 358 [2019-09-05 12:15:35,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2019-09-05 12:15:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-05 12:15:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-09-05 12:15:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-05 12:15:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-09-05 12:15:35,592 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 354 [2019-09-05 12:15:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:35,593 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-09-05 12:15:35,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 175 states. [2019-09-05 12:15:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-09-05 12:15:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-05 12:15:35,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:35,594 INFO L399 BasicCegarLoop]: trace histogram [173, 173, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:35,594 INFO L418 AbstractCegarLoop]: === Iteration 175 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:35,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:35,594 INFO L82 PathProgramCache]: Analyzing trace with hash 935213985, now seen corresponding path program 173 times [2019-09-05 12:15:35,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:35,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:35,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:35,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:35,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 29929 backedges. 0 proven. 29929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:45,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:45,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:45,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:15:45,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 174 check-sat command(s) [2019-09-05 12:15:45,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:45,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-05 12:15:45,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 29929 backedges. 0 proven. 29929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:45,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:45,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176, 176] total 176 [2019-09-05 12:15:45,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-09-05 12:15:46,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-09-05 12:15:46,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-09-05 12:15:46,000 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 176 states. [2019-09-05 12:15:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:47,263 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-09-05 12:15:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-05 12:15:47,263 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 356 [2019-09-05 12:15:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:47,264 INFO L225 Difference]: With dead ends: 365 [2019-09-05 12:15:47,264 INFO L226 Difference]: Without dead ends: 360 [2019-09-05 12:15:47,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-09-05 12:15:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-05 12:15:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2019-09-05 12:15:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-05 12:15:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2019-09-05 12:15:47,267 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 356 [2019-09-05 12:15:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:47,268 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2019-09-05 12:15:47,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-09-05 12:15:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2019-09-05 12:15:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-05 12:15:47,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:47,269 INFO L399 BasicCegarLoop]: trace histogram [174, 174, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:47,269 INFO L418 AbstractCegarLoop]: === Iteration 176 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2067131809, now seen corresponding path program 174 times [2019-09-05 12:15:47,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:47,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 30276 backedges. 0 proven. 30276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:57,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:57,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:57,464 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:15:57,764 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 175 check-sat command(s) [2019-09-05 12:15:57,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:57,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 176 conjunts are in the unsatisfiable core [2019-09-05 12:15:57,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30276 backedges. 0 proven. 30276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:15:57,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:57,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177, 177] total 177 [2019-09-05 12:15:57,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-05 12:15:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-05 12:15:57,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2019-09-05 12:15:57,860 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 177 states. [2019-09-05 12:15:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:59,449 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-09-05 12:15:59,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-09-05 12:15:59,449 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 358 [2019-09-05 12:15:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:59,450 INFO L225 Difference]: With dead ends: 367 [2019-09-05 12:15:59,450 INFO L226 Difference]: Without dead ends: 362 [2019-09-05 12:15:59,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2019-09-05 12:15:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-05 12:15:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-09-05 12:15:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-05 12:15:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-09-05 12:15:59,453 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 358 [2019-09-05 12:15:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:59,454 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-09-05 12:15:59,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-05 12:15:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-09-05 12:15:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-05 12:15:59,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:59,455 INFO L399 BasicCegarLoop]: trace histogram [175, 175, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:59,455 INFO L418 AbstractCegarLoop]: === Iteration 177 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:59,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1103416931, now seen corresponding path program 175 times [2019-09-05 12:15:59,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:59,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:59,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:59,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:59,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:16:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30625 backedges. 0 proven. 30625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:09,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:16:09,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:16:09,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:16:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:16:09,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 177 conjunts are in the unsatisfiable core [2019-09-05 12:16:09,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:16:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30625 backedges. 0 proven. 30625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:16:09,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:16:09,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178, 178] total 178 [2019-09-05 12:16:09,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-09-05 12:16:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-09-05 12:16:09,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-09-05 12:16:09,862 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 178 states. [2019-09-05 12:16:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:16:11,799 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2019-09-05 12:16:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-05 12:16:11,799 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 360 [2019-09-05 12:16:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:16:11,800 INFO L225 Difference]: With dead ends: 369 [2019-09-05 12:16:11,800 INFO L226 Difference]: Without dead ends: 364 [2019-09-05 12:16:11,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-09-05 12:16:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-05 12:16:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 363. [2019-09-05 12:16:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-05 12:16:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2019-09-05 12:16:11,804 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 360 [2019-09-05 12:16:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:16:11,804 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2019-09-05 12:16:11,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-09-05 12:16:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2019-09-05 12:16:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-05 12:16:11,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:16:11,805 INFO L399 BasicCegarLoop]: trace histogram [176, 176, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:16:11,805 INFO L418 AbstractCegarLoop]: === Iteration 178 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:16:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:16:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1608612187, now seen corresponding path program 176 times [2019-09-05 12:16:11,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:16:11,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:16:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:11,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:16:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:16:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat