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-acceleration/array_2-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:34:27,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:34:27,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:34:27,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:34:27,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:34:27,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:34:27,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:34:27,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:34:27,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:34:27,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:34:27,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:34:27,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:34:27,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:34:27,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:34:27,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:34:27,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:34:27,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:34:27,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:34:27,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:34:27,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:34:27,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:34:27,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:34:27,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:34:27,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:34:27,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:34:27,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:34:27,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:34:27,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:34:27,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:34:27,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:34:27,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:34:27,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:34:27,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:34:27,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:34:27,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:34:27,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:34:27,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:34:27,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:34:27,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:34:27,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:34:27,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:34:27,987 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-08 02:34:28,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:34:28,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:34:28,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:34:28,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:34:28,010 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:34:28,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:34:28,010 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:34:28,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:34:28,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:34:28,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:34:28,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:34:28,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:34:28,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:34:28,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:34:28,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:34:28,013 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:34:28,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:34:28,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:34:28,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:34:28,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:34:28,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:34:28,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:34:28,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:34:28,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:34:28,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:34:28,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:34:28,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:34:28,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:34:28,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:34:28,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:34:28,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:34:28,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:34:28,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:34:28,077 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:34:28,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-1.i [2019-09-08 02:34:28,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0b428d1/db866f584b024972861c1d6c45bddce8/FLAG7729f248e [2019-09-08 02:34:28,545 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:34:28,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-1.i [2019-09-08 02:34:28,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0b428d1/db866f584b024972861c1d6c45bddce8/FLAG7729f248e [2019-09-08 02:34:28,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0b428d1/db866f584b024972861c1d6c45bddce8 [2019-09-08 02:34:28,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:34:28,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:34:28,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:34:28,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:34:28,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:34:28,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:34:28" (1/1) ... [2019-09-08 02:34:28,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd4a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:28, skipping insertion in model container [2019-09-08 02:34:28,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:34:28" (1/1) ... [2019-09-08 02:34:28,971 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:34:28,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:34:29,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:34:29,232 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:34:29,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:34:29,280 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:34:29,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29 WrapperNode [2019-09-08 02:34:29,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:34:29,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:34:29,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:34:29,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:34:29,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (1/1) ... [2019-09-08 02:34:29,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (1/1) ... [2019-09-08 02:34:29,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (1/1) ... [2019-09-08 02:34:29,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (1/1) ... [2019-09-08 02:34:29,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (1/1) ... [2019-09-08 02:34:29,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (1/1) ... [2019-09-08 02:34:29,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (1/1) ... [2019-09-08 02:34:29,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:34:29,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:34:29,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:34:29,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:34:29,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (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-08 02:34:29,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:34:29,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:34:29,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:34:29,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:34:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:34:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:34:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:34:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:34:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:34:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:34:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:34:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:34:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:34:29,728 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:34:29,728 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 02:34:29,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:34:29 BoogieIcfgContainer [2019-09-08 02:34:29,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:34:29,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:34:29,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:34:29,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:34:29,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:34:28" (1/3) ... [2019-09-08 02:34:29,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a2b4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:34:29, skipping insertion in model container [2019-09-08 02:34:29,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:34:29" (2/3) ... [2019-09-08 02:34:29,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a2b4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:34:29, skipping insertion in model container [2019-09-08 02:34:29,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:34:29" (3/3) ... [2019-09-08 02:34:29,755 INFO L109 eAbstractionObserver]: Analyzing ICFG array_2-1.i [2019-09-08 02:34:29,778 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:34:29,795 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:34:29,824 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:34:29,856 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:34:29,857 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:34:29,857 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:34:29,857 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:34:29,859 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:34:29,859 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:34:29,859 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:34:29,859 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:34:29,859 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:34:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-08 02:34:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:34:29,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:29,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:29,884 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2019-09-08 02:34:29,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:29,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:29,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:29,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:30,009 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-08 02:34:30,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:34:30,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:34:30,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:34:30,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:34:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:34:30,026 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-08 02:34:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:30,045 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-08 02:34:30,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:34:30,046 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-08 02:34:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:30,052 INFO L225 Difference]: With dead ends: 34 [2019-09-08 02:34:30,052 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 02:34:30,055 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-08 02:34:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 02:34:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-08 02:34:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-08 02:34:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-08 02:34:30,095 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-08 02:34:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:30,096 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-08 02:34:30,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:34:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-08 02:34:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:34:30,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:30,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:30,097 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2019-09-08 02:34:30,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:30,177 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-08 02:34:30,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:34:30,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:34:30,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:34:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:34:30,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:34:30,180 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2019-09-08 02:34:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:30,215 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-08 02:34:30,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:34:30,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-08 02:34:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:30,217 INFO L225 Difference]: With dead ends: 22 [2019-09-08 02:34:30,217 INFO L226 Difference]: Without dead ends: 16 [2019-09-08 02:34:30,218 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-08 02:34:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-08 02:34:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-08 02:34:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 02:34:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-08 02:34:30,223 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-08 02:34:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:30,223 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-08 02:34:30,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:34:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-08 02:34:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:34:30,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:30,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:30,224 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2019-09-08 02:34:30,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:30,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:30,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:30,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:30,288 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-08 02:34:30,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:30,288 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) [2019-09-08 02:34:30,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:30,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 02:34:30,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:30,380 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-08 02:34:30,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:30,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 02:34:30,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:34:30,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:34:30,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:34:30,389 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-08 02:34:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:30,416 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-08 02:34:30,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:34:30,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 02:34:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:30,418 INFO L225 Difference]: With dead ends: 24 [2019-09-08 02:34:30,418 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 02:34:30,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-08 02:34:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 02:34:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-08 02:34:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 02:34:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-08 02:34:30,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-08 02:34:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:30,424 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-08 02:34:30,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:34:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-08 02:34:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:34:30,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:30,425 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:30,426 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2019-09-08 02:34:30,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:30,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:30,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:30,478 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-08 02:34:30,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:30,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 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-08 02:34:30,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:34:30,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:34:30,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:30,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 02:34:30,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:30,534 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-08 02:34:30,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:30,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 02:34:30,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:34:30,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:34:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:34:30,541 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-08 02:34:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:30,574 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-08 02:34:30,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:34:30,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-08 02:34:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:30,575 INFO L225 Difference]: With dead ends: 26 [2019-09-08 02:34:30,575 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 02:34:30,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:34:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 02:34:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-08 02:34:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 02:34:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-08 02:34:30,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-08 02:34:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:30,581 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-08 02:34:30,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:34:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-08 02:34:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:34:30,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:30,582 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:30,583 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:30,583 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2019-09-08 02:34:30,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:30,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:30,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:30,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:30,654 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-08 02:34:30,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:30,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 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-08 02:34:30,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:34:30,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:34:30,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:30,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 02:34:30,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:30,735 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-08 02:34:30,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:30,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 02:34:30,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:34:30,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:34:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:34:30,747 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-08 02:34:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:30,788 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-08 02:34:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:34:30,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-08 02:34:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:30,789 INFO L225 Difference]: With dead ends: 28 [2019-09-08 02:34:30,790 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 02:34:30,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:34:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 02:34:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-08 02:34:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 02:34:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-08 02:34:30,795 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-08 02:34:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:30,796 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-08 02:34:30,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:34:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-08 02:34:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:34:30,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:30,797 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:30,797 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:30,798 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 4 times [2019-09-08 02:34:30,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:30,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:30,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:30,882 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-08 02:34:30,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:30,884 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-08 02:34:30,917 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-08 02:34:30,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:34:30,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:30,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 02:34:30,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:30,962 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-08 02:34:30,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:30,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 02:34:30,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:34:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:34:30,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:34:30,970 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-08 02:34:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:31,002 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-08 02:34:31,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:34:31,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-08 02:34:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:31,004 INFO L225 Difference]: With dead ends: 30 [2019-09-08 02:34:31,004 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 02:34:31,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:34:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 02:34:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-08 02:34:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 02:34:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-08 02:34:31,009 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-08 02:34:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:31,009 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-08 02:34:31,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:34:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-08 02:34:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:34:31,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:31,010 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:31,011 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash 954425671, now seen corresponding path program 5 times [2019-09-08 02:34:31,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:31,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:31,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:31,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:31,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:31,123 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-08 02:34:31,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:31,124 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-08 02:34:31,138 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-08 02:34:31,182 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 02:34:31,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:31,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:34:31,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:31,199 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-08 02:34:31,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:31,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 02:34:31,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:34:31,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:34:31,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:34:31,209 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-08 02:34:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:31,250 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-08 02:34:31,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:34:31,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-08 02:34:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:31,252 INFO L225 Difference]: With dead ends: 32 [2019-09-08 02:34:31,252 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 02:34:31,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:34:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 02:34:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-08 02:34:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:34:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-08 02:34:31,257 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-08 02:34:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:31,258 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-08 02:34:31,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:34:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-08 02:34:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:34:31,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:31,259 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:31,259 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:31,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1534314089, now seen corresponding path program 6 times [2019-09-08 02:34:31,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:31,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:31,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:31,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:31,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:31,339 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-08 02:34:31,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:31,340 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-08 02:34:31,352 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:34:31,391 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:34:31,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:31,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 02:34:31,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:31,407 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-08 02:34:31,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:31,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 02:34:31,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:34:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:34:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:34:31,417 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-08 02:34:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:31,468 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-08 02:34:31,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:34:31,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-08 02:34:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:31,473 INFO L225 Difference]: With dead ends: 34 [2019-09-08 02:34:31,473 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 02:34:31,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:34:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 02:34:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 02:34:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:34:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-08 02:34:31,482 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-08 02:34:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:31,482 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-08 02:34:31,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:34:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-08 02:34:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 02:34:31,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:31,484 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:31,485 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 461335307, now seen corresponding path program 7 times [2019-09-08 02:34:31,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:31,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:31,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:31,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:31,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:31,619 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-08 02:34:31,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:31,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:34:31,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:31,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:34:31,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:31,679 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-08 02:34:31,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:31,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 02:34:31,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:34:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:34:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:34:31,690 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-08 02:34:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:31,742 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-08 02:34:31,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:34:31,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-08 02:34:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:31,743 INFO L225 Difference]: With dead ends: 36 [2019-09-08 02:34:31,744 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 02:34:31,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:34:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 02:34:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-08 02:34:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 02:34:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-08 02:34:31,748 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-08 02:34:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:31,749 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-08 02:34:31,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:34:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-08 02:34:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:34:31,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:31,750 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:31,750 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:31,751 INFO L82 PathProgramCache]: Analyzing trace with hash 120876845, now seen corresponding path program 8 times [2019-09-08 02:34:31,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:31,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:31,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:31,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:31,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:31,856 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-08 02:34:31,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:31,857 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-08 02:34:31,878 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-08 02:34:31,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:34:31,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:31,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:34:31,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:31,927 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-08 02:34:31,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:31,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 02:34:31,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:34:31,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:34:31,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:34:31,941 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-08 02:34:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:32,000 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-08 02:34:32,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:34:32,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-08 02:34:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:32,003 INFO L225 Difference]: With dead ends: 38 [2019-09-08 02:34:32,003 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:34:32,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:34:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:34:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-08 02:34:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:34:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-08 02:34:32,013 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-08 02:34:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:32,013 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-08 02:34:32,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:34:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-08 02:34:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:34:32,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:32,019 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:32,020 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:32,020 INFO L82 PathProgramCache]: Analyzing trace with hash -642190641, now seen corresponding path program 9 times [2019-09-08 02:34:32,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:32,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:32,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:32,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:32,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:32,166 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-08 02:34:32,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:32,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:32,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:34:32,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 02:34:32,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:32,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 02:34:32,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:32,328 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-08 02:34:32,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:32,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 02:34:32,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:34:32,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:34:32,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:34:32,337 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2019-09-08 02:34:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:32,399 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-08 02:34:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:34:32,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-08 02:34:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:32,401 INFO L225 Difference]: With dead ends: 40 [2019-09-08 02:34:32,401 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 02:34:32,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:34:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 02:34:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-08 02:34:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:34:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-08 02:34:32,409 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-08 02:34:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:32,410 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-08 02:34:32,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:34:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-08 02:34:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 02:34:32,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:32,412 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:32,413 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 10 times [2019-09-08 02:34:32,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:32,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:32,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:32,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:32,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:32,549 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-08 02:34:32,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:32,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:32,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:34:32,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:34:32,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:32,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:34:32,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:32,623 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-08 02:34:32,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:32,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 02:34:32,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:34:32,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:34:32,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:34:32,628 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-09-08 02:34:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:32,681 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-08 02:34:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:34:32,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-09-08 02:34:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:32,682 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:34:32,683 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 02:34:32,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:34:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 02:34:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-08 02:34:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 02:34:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-08 02:34:32,687 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-08 02:34:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:32,687 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-08 02:34:32,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:34:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-08 02:34:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 02:34:32,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:32,689 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:32,689 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1285617811, now seen corresponding path program 11 times [2019-09-08 02:34:32,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:32,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:32,846 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-08 02:34:32,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:32,847 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) [2019-09-08 02:34:32,872 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:32,967 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 02:34:32,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:32,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 02:34:32,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:32,995 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-08 02:34:33,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:33,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 02:34:33,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:34:33,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:34:33,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:34:33,005 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-09-08 02:34:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:33,060 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-08 02:34:33,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:34:33,060 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-08 02:34:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:33,061 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:34:33,061 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 02:34:33,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:34:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 02:34:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-08 02:34:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 02:34:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-08 02:34:33,066 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-08 02:34:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:33,067 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-08 02:34:33,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:34:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-08 02:34:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:34:33,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:33,068 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:33,068 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1982380725, now seen corresponding path program 12 times [2019-09-08 02:34:33,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:33,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:33,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:33,237 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-08 02:34:33,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:33,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:33,255 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:34:33,372 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 02:34:33,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:33,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:34:33,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:33,416 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-08 02:34:33,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:33,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 02:34:33,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:34:33,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:34:33,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:34:33,427 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-09-08 02:34:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:33,475 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-08 02:34:33,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:34:33,475 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-09-08 02:34:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:33,476 INFO L225 Difference]: With dead ends: 46 [2019-09-08 02:34:33,476 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:34:33,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:34:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:34:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-08 02:34:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 02:34:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-08 02:34:33,486 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-08 02:34:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:33,489 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-08 02:34:33,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:34:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-08 02:34:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 02:34:33,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:33,490 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:33,490 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:33,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1556642903, now seen corresponding path program 13 times [2019-09-08 02:34:33,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:33,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:33,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:33,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:33,664 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-08 02:34:33,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:33,665 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-08 02:34:33,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:33,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:34:33,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:33,717 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-08 02:34:33,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:33,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-08 02:34:33,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:34:33,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:34:33,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:34:33,722 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-09-08 02:34:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:33,782 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-08 02:34:33,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:34:33,782 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-09-08 02:34:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:33,783 INFO L225 Difference]: With dead ends: 48 [2019-09-08 02:34:33,783 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 02:34:33,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:34:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 02:34:33,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-08 02:34:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 02:34:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-08 02:34:33,788 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-08 02:34:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:33,789 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-08 02:34:33,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:34:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-08 02:34:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 02:34:33,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:33,790 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:33,790 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:33,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash 444489081, now seen corresponding path program 14 times [2019-09-08 02:34:33,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:33,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:33,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:33,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:33,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:33,954 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-08 02:34:33,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:33,954 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-08 02:34:33,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:34:33,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:34:33,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:33,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 02:34:33,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:34:34,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:34,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 02:34:34,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:34:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:34:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:34:34,027 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-09-08 02:34:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:34,099 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-08 02:34:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:34:34,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-09-08 02:34:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:34,101 INFO L225 Difference]: With dead ends: 50 [2019-09-08 02:34:34,101 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 02:34:34,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:34:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 02:34:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-08 02:34:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 02:34:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-08 02:34:34,110 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-08 02:34:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:34,111 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-08 02:34:34,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:34:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-08 02:34:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 02:34:34,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:34,112 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:34,113 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1111522843, now seen corresponding path program 15 times [2019-09-08 02:34:34,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:34,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:34,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:34,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:34,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:34,289 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-08 02:34:34,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:34,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 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-08 02:34:34,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:34:34,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 02:34:34,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:34,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 02:34:34,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Stream closed [2019-09-08 02:34:34,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:34,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-08 02:34:34,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:34:34,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:34:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:34:34,772 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-09-08 02:34:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:34,843 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-08 02:34:34,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:34:34,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-09-08 02:34:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:34,844 INFO L225 Difference]: With dead ends: 52 [2019-09-08 02:34:34,845 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:34:34,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:34:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:34:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-08 02:34:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 02:34:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-08 02:34:34,857 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-08 02:34:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:34,857 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-08 02:34:34,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:34:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-08 02:34:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 02:34:34,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:34,858 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:34,859 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:34,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2114126275, now seen corresponding path program 16 times [2019-09-08 02:34:34,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:34,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:34,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:35,064 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-08 02:34:35,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:35,064 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) [2019-09-08 02:34:35,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:35,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:34:35,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:35,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 02:34:35,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:35,143 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-08 02:34:35,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:35,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-08 02:34:35,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:34:35,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:34:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:34:35,148 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2019-09-08 02:34:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:35,205 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-08 02:34:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:34:35,206 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-09-08 02:34:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:35,206 INFO L225 Difference]: With dead ends: 54 [2019-09-08 02:34:35,206 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 02:34:35,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:34:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 02:34:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-08 02:34:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 02:34:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-08 02:34:35,222 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-08 02:34:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:35,222 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-08 02:34:35,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:34:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-08 02:34:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 02:34:35,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:35,223 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:35,223 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash -996540961, now seen corresponding path program 17 times [2019-09-08 02:34:35,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:35,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:35,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:35,471 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-08 02:34:35,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:35,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:34:35,495 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:35,728 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 02:34:35,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:35,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:34:35,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:35,750 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-08 02:34:35,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:35,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-08 02:34:35,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:34:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:34:35,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:34:35,762 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2019-09-08 02:34:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:35,835 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-08 02:34:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:34:35,835 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-09-08 02:34:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:35,836 INFO L225 Difference]: With dead ends: 56 [2019-09-08 02:34:35,836 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 02:34:35,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:34:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 02:34:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-08 02:34:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 02:34:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-08 02:34:35,842 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-08 02:34:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:35,842 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-08 02:34:35,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:34:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-08 02:34:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 02:34:35,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:35,843 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:35,843 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash -738878207, now seen corresponding path program 18 times [2019-09-08 02:34:35,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:35,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:35,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:36,080 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-08 02:34:36,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:36,081 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) [2019-09-08 02:34:36,096 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:36,722 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 02:34:36,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:36,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 02:34:36,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:36,747 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-08 02:34:36,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:36,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 02:34:36,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:34:36,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:34:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:34:36,755 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2019-09-08 02:34:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:36,832 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-08 02:34:36,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:34:36,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-08 02:34:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:36,834 INFO L225 Difference]: With dead ends: 58 [2019-09-08 02:34:36,834 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 02:34:36,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:34:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 02:34:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-08 02:34:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 02:34:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-08 02:34:36,839 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-08 02:34:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:36,839 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-08 02:34:36,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:34:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-08 02:34:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 02:34:36,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:36,840 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:36,840 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:36,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2061892515, now seen corresponding path program 19 times [2019-09-08 02:34:36,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:36,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:36,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:36,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:36,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:37,070 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-08 02:34:37,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:37,070 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-08 02:34:37,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:37,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:34:37,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:37,131 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-08 02:34:37,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:37,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-08 02:34:37,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:34:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:34:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:34:37,141 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2019-09-08 02:34:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:37,223 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-08 02:34:37,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 02:34:37,224 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-08 02:34:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:37,225 INFO L225 Difference]: With dead ends: 60 [2019-09-08 02:34:37,225 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 02:34:37,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:34:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 02:34:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-08 02:34:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 02:34:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-08 02:34:37,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-08 02:34:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:37,233 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-08 02:34:37,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:34:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-08 02:34:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 02:34:37,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:37,235 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:37,235 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:37,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash 658061765, now seen corresponding path program 20 times [2019-09-08 02:34:37,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:37,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:37,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:37,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:37,484 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-08 02:34:37,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:37,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 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-08 02:34:37,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:34:37,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:34:37,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:37,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 02:34:37,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:37,556 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-08 02:34:37,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:37,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 02:34:37,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:34:37,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:34:37,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:34:37,566 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2019-09-08 02:34:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:37,638 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-08 02:34:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:34:37,640 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2019-09-08 02:34:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:37,641 INFO L225 Difference]: With dead ends: 62 [2019-09-08 02:34:37,641 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 02:34:37,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:34:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 02:34:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-08 02:34:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 02:34:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-08 02:34:37,646 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-08 02:34:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:37,646 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-08 02:34:37,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:34:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-08 02:34:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 02:34:37,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:37,647 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:37,649 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash 196441959, now seen corresponding path program 21 times [2019-09-08 02:34:37,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:37,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:37,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:37,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:37,901 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-08 02:34:37,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:37,902 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-08 02:34:37,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:34:39,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-08 02:34:39,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:39,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 02:34:39,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:39,202 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-08 02:34:39,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:39,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-08 02:34:39,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:34:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:34:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:34:39,210 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-09-08 02:34:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:39,294 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-09-08 02:34:39,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 02:34:39,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-09-08 02:34:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:39,296 INFO L225 Difference]: With dead ends: 64 [2019-09-08 02:34:39,296 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 02:34:39,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:34:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 02:34:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-08 02:34:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 02:34:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-08 02:34:39,301 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-08 02:34:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:39,301 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-08 02:34:39,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:34:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-08 02:34:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 02:34:39,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:39,303 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:39,303 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:39,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 22 times [2019-09-08 02:34:39,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:39,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:39,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:39,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:39,618 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-08 02:34:39,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:39,618 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-08 02:34:39,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:34:39,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:34:39,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:39,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 02:34:39,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:34:39,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:39,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-08 02:34:39,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:34:39,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:34:39,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:34:39,699 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-09-08 02:34:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:39,781 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-09-08 02:34:39,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:34:39,782 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-08 02:34:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:39,783 INFO L225 Difference]: With dead ends: 66 [2019-09-08 02:34:39,784 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 02:34:39,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:34:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 02:34:39,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-08 02:34:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 02:34:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-08 02:34:39,788 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-08 02:34:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:39,790 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-08 02:34:39,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:34:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-08 02:34:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 02:34:39,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:39,792 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:39,792 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:39,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1830383915, now seen corresponding path program 23 times [2019-09-08 02:34:39,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:39,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:39,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:39,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:39,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:40,218 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-08 02:34:40,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:40,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:34:40,231 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:40,523 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-08 02:34:40,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:40,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 02:34:40,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:40,544 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-08 02:34:40,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:40,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-08 02:34:40,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:34:40,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:34:40,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:34:40,551 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2019-09-08 02:34:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:40,640 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-09-08 02:34:40,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:34:40,641 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-09-08 02:34:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:40,641 INFO L225 Difference]: With dead ends: 68 [2019-09-08 02:34:40,641 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 02:34:40,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:34:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 02:34:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-08 02:34:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-08 02:34:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-08 02:34:40,646 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-08 02:34:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:40,646 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-08 02:34:40,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:34:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-08 02:34:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 02:34:40,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:40,647 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:40,647 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:40,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1516596557, now seen corresponding path program 24 times [2019-09-08 02:34:40,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:40,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:40,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:40,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:40,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:41,084 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-08 02:34:41,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:41,084 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-08 02:34:41,105 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:34:44,314 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-08 02:34:44,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:44,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 02:34:44,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:44,335 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-08 02:34:44,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:44,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-08 02:34:44,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:34:44,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:34:44,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:34:44,344 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-09-08 02:34:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:44,441 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-09-08 02:34:44,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:34:44,441 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-09-08 02:34:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:44,442 INFO L225 Difference]: With dead ends: 70 [2019-09-08 02:34:44,442 INFO L226 Difference]: Without dead ends: 64 [2019-09-08 02:34:44,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:34:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-08 02:34:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-08 02:34:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 02:34:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-08 02:34:44,447 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-08 02:34:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:44,447 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-08 02:34:44,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:34:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-08 02:34:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 02:34:44,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:44,448 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:44,448 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:44,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:44,449 INFO L82 PathProgramCache]: Analyzing trace with hash 614656239, now seen corresponding path program 25 times [2019-09-08 02:34:44,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:44,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:44,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:44,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:44,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:44,851 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-08 02:34:44,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:44,852 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-08 02:34:44,870 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-08 02:34:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:44,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 02:34:44,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:44,936 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-08 02:34:44,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:44,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-08 02:34:44,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:34:44,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:34:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:34:44,943 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2019-09-08 02:34:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:45,037 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-09-08 02:34:45,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 02:34:45,037 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-09-08 02:34:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:45,038 INFO L225 Difference]: With dead ends: 72 [2019-09-08 02:34:45,038 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 02:34:45,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:34:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 02:34:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-08 02:34:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-08 02:34:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-08 02:34:45,042 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-08 02:34:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:45,043 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-08 02:34:45,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:34:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-08 02:34:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 02:34:45,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:45,044 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:45,044 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1433404433, now seen corresponding path program 26 times [2019-09-08 02:34:45,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:45,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:45,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:45,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:34:45,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:45,495 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-08 02:34:45,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:45,496 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-08 02:34:45,515 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-08 02:34:45,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:34:45,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:45,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 02:34:45,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:45,585 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-08 02:34:45,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:45,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-08 02:34:45,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:34:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:34:45,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:34:45,589 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2019-09-08 02:34:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:45,686 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-09-08 02:34:45,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:34:45,686 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-08 02:34:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:45,687 INFO L225 Difference]: With dead ends: 74 [2019-09-08 02:34:45,687 INFO L226 Difference]: Without dead ends: 68 [2019-09-08 02:34:45,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:34:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-08 02:34:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-08 02:34:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 02:34:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-08 02:34:45,690 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-08 02:34:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:45,691 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-08 02:34:45,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:34:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-08 02:34:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 02:34:45,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:45,692 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:45,692 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2023563597, now seen corresponding path program 27 times [2019-09-08 02:34:45,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:45,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:45,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:45,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:45,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:46,312 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-08 02:34:46,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:46,312 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) [2019-09-08 02:34:46,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:51,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-08 02:34:51,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:51,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 02:34:51,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:51,831 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-08 02:34:51,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:51,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-08 02:34:51,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:34:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:34:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:34:51,840 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2019-09-08 02:34:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:51,941 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-09-08 02:34:51,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:34:51,942 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-09-08 02:34:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:51,943 INFO L225 Difference]: With dead ends: 76 [2019-09-08 02:34:51,943 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 02:34:51,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:34:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 02:34:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-08 02:34:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 02:34:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-08 02:34:51,949 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-08 02:34:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:51,951 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-08 02:34:51,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:34:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-08 02:34:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 02:34:51,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:51,952 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:51,952 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash 134846677, now seen corresponding path program 28 times [2019-09-08 02:34:51,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:51,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:51,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:52,374 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-08 02:34:52,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:52,375 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-08 02:34:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:34:52,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:34:52,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:52,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 02:34:52,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:52,442 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-08 02:34:52,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:52,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-08 02:34:52,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:34:52,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:34:52,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:34:52,447 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2019-09-08 02:34:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:52,546 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-09-08 02:34:52,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:34:52,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-09-08 02:34:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:52,547 INFO L225 Difference]: With dead ends: 78 [2019-09-08 02:34:52,548 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 02:34:52,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:34:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 02:34:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-08 02:34:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-08 02:34:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-08 02:34:52,552 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-08 02:34:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:52,553 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-08 02:34:52,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:34:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-08 02:34:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 02:34:52,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:52,554 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:52,554 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:52,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:52,555 INFO L82 PathProgramCache]: Analyzing trace with hash -102083977, now seen corresponding path program 29 times [2019-09-08 02:34:52,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:52,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:52,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:52,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:52,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:53,034 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-08 02:34:53,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:53,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:34:53,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:53,619 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-08 02:34:53,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:34:53,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 02:34:53,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:34:53,639 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-08 02:34:53,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:34:53,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-08 02:34:53,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:34:53,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:34:53,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:34:53,646 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2019-09-08 02:34:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:34:53,754 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-09-08 02:34:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:34:53,755 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2019-09-08 02:34:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:34:53,756 INFO L225 Difference]: With dead ends: 80 [2019-09-08 02:34:53,756 INFO L226 Difference]: Without dead ends: 74 [2019-09-08 02:34:53,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:34:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-08 02:34:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-08 02:34:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 02:34:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-08 02:34:53,760 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-08 02:34:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:34:53,760 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-08 02:34:53,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:34:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-08 02:34:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:34:53,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:34:53,761 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:34:53,761 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:34:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:34:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash -159175783, now seen corresponding path program 30 times [2019-09-08 02:34:53,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:34:53,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:34:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:53,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:34:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:34:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:34:54,196 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-08 02:34:54,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:34:54,196 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) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:34:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:35:00,445 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-08 02:35:00,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:00,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 02:35:00,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:00,468 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-08 02:35:00,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:00,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 02:35:00,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 02:35:00,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 02:35:00,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:35:00,477 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2019-09-08 02:35:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:00,573 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-09-08 02:35:00,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:35:00,574 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-08 02:35:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:00,575 INFO L225 Difference]: With dead ends: 82 [2019-09-08 02:35:00,575 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 02:35:00,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:35:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 02:35:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-08 02:35:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 02:35:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-08 02:35:00,581 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-08 02:35:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:00,581 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-08 02:35:00,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 02:35:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-08 02:35:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 02:35:00,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:00,582 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:00,582 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash 810173499, now seen corresponding path program 31 times [2019-09-08 02:35:00,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:00,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:00,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:00,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:00,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:01,003 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-08 02:35:01,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:01,004 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-08 02:35:01,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:01,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 02:35:01,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:01,070 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-08 02:35:01,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:01,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-08 02:35:01,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 02:35:01,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 02:35:01,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:35:01,075 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2019-09-08 02:35:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:01,194 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-09-08 02:35:01,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 02:35:01,195 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-09-08 02:35:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:01,196 INFO L225 Difference]: With dead ends: 84 [2019-09-08 02:35:01,196 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 02:35:01,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:35:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 02:35:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-08 02:35:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 02:35:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-08 02:35:01,202 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-08 02:35:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:01,202 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-08 02:35:01,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 02:35:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-08 02:35:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 02:35:01,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:01,203 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:01,204 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash 346930269, now seen corresponding path program 32 times [2019-09-08 02:35:01,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:01,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:01,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:01,688 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-08 02:35:01,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:01,689 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-08 02:35:01,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:35:01,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:35:01,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:01,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:35:01,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:35:01,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:01,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-08 02:35:01,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:35:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:35:01,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:35:01,766 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2019-09-08 02:35:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:01,883 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-09-08 02:35:01,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:35:01,883 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-09-08 02:35:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:01,884 INFO L225 Difference]: With dead ends: 86 [2019-09-08 02:35:01,885 INFO L226 Difference]: Without dead ends: 80 [2019-09-08 02:35:01,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:35:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-08 02:35:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-08 02:35:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 02:35:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-08 02:35:01,890 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-08 02:35:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:01,890 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-08 02:35:01,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:35:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-08 02:35:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 02:35:01,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:01,891 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:01,891 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:01,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:01,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1846785023, now seen corresponding path program 33 times [2019-09-08 02:35:01,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:01,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:01,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:02,381 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-08 02:35:02,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:02,382 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-08 02:35:02,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:35:17,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-08 02:35:17,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:17,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 02:35:17,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:17,689 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-08 02:35:17,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:17,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-08 02:35:17,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 02:35:17,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 02:35:17,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:35:17,699 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2019-09-08 02:35:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:17,791 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-09-08 02:35:17,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 02:35:17,791 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-09-08 02:35:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:17,792 INFO L225 Difference]: With dead ends: 88 [2019-09-08 02:35:17,793 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 02:35:17,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:35:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 02:35:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-08 02:35:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-08 02:35:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-08 02:35:17,798 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-08 02:35:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:17,798 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-08 02:35:17,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 02:35:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-08 02:35:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 02:35:17,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:17,799 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:17,799 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:17,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:17,799 INFO L82 PathProgramCache]: Analyzing trace with hash 98192161, now seen corresponding path program 34 times [2019-09-08 02:35:17,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:17,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:17,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:17,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:17,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:18,306 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-08 02:35:18,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:18,307 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-08 02:35:18,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:35:18,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:35:18,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:18,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 02:35:18,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:35:18,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:18,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-08 02:35:18,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 02:35:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 02:35:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:35:18,411 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2019-09-08 02:35:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:18,505 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-09-08 02:35:18,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:35:18,505 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-08 02:35:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:18,506 INFO L225 Difference]: With dead ends: 90 [2019-09-08 02:35:18,506 INFO L226 Difference]: Without dead ends: 84 [2019-09-08 02:35:18,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:35:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-08 02:35:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-08 02:35:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-08 02:35:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-08 02:35:18,510 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-08 02:35:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:18,510 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-08 02:35:18,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 02:35:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-08 02:35:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 02:35:18,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:18,511 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:18,511 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash -967335485, now seen corresponding path program 35 times [2019-09-08 02:35:18,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:18,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:18,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:18,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:18,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:19,055 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-08 02:35:19,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:19,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:19,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:35:20,012 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-08 02:35:20,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:20,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 02:35:20,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:35:20,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-08 02:35:20,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:35:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:35:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:35:20,050 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2019-09-08 02:35:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:20,167 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-09-08 02:35:20,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 02:35:20,168 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2019-09-08 02:35:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:20,169 INFO L225 Difference]: With dead ends: 92 [2019-09-08 02:35:20,169 INFO L226 Difference]: Without dead ends: 86 [2019-09-08 02:35:20,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:35:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-08 02:35:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-08 02:35:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-08 02:35:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-08 02:35:20,174 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-08 02:35:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:20,175 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-08 02:35:20,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:35:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-08 02:35:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 02:35:20,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:20,177 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:20,177 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:20,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1557780453, now seen corresponding path program 36 times [2019-09-08 02:35:20,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:20,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:20,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:20,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:20,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:21,031 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-08 02:35:21,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:21,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:35:21,044 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:35:51,464 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-08 02:35:51,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:51,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:35:51,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:51,516 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-08 02:35:51,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:51,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-08 02:35:51,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 02:35:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 02:35:51,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:35:51,530 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2019-09-08 02:35:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:51,680 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-09-08 02:35:51,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 02:35:51,684 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-09-08 02:35:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:51,685 INFO L225 Difference]: With dead ends: 94 [2019-09-08 02:35:51,685 INFO L226 Difference]: Without dead ends: 88 [2019-09-08 02:35:51,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:35:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-08 02:35:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-08 02:35:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-08 02:35:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-08 02:35:51,691 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-08 02:35:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:51,691 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-08 02:35:51,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 02:35:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-08 02:35:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 02:35:51,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:51,693 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:51,693 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1537674631, now seen corresponding path program 37 times [2019-09-08 02:35:51,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:51,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:51,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:51,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:51,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:52,368 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-08 02:35:52,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:52,368 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-08 02:35:52,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:52,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 02:35:52,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:35:52,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:52,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-08 02:35:52,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 02:35:52,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 02:35:52,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:35:52,456 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2019-09-08 02:35:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:52,588 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-09-08 02:35:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 02:35:52,589 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-09-08 02:35:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:52,590 INFO L225 Difference]: With dead ends: 96 [2019-09-08 02:35:52,590 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 02:35:52,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:35:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 02:35:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-08 02:35:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-08 02:35:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-08 02:35:52,594 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-08 02:35:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:52,594 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-08 02:35:52,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 02:35:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-08 02:35:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 02:35:52,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:52,595 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:52,596 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash -604151127, now seen corresponding path program 38 times [2019-09-08 02:35:52,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:52,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:53,255 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-08 02:35:53,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:53,256 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-08 02:35:53,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:35:53,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:35:53,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:35:53,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 02:35:53,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:53,340 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-08 02:35:53,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:53,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-08 02:35:53,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 02:35:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 02:35:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:35:53,344 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2019-09-08 02:35:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:53,453 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-09-08 02:35:53,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:35:53,454 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-08 02:35:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:53,455 INFO L225 Difference]: With dead ends: 98 [2019-09-08 02:35:53,455 INFO L226 Difference]: Without dead ends: 92 [2019-09-08 02:35:53,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:35:53,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-08 02:35:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-08 02:35:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-08 02:35:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-08 02:35:53,464 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-08 02:35:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:53,464 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-08 02:35:53,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 02:35:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-08 02:35:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 02:35:53,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:53,467 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:53,467 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1609369781, now seen corresponding path program 39 times [2019-09-08 02:35:53,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:53,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:53,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:35:53,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:54,165 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-08 02:35:54,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:54,166 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-08 02:35:54,179 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-08 02:36:48,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-08 02:36:48,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:48,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:36:48,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:48,337 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-08 02:36:48,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:48,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-08 02:36:48,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 02:36:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 02:36:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:36:48,352 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2019-09-08 02:36:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:48,474 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-09-08 02:36:48,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 02:36:48,474 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2019-09-08 02:36:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:48,475 INFO L225 Difference]: With dead ends: 100 [2019-09-08 02:36:48,476 INFO L226 Difference]: Without dead ends: 94 [2019-09-08 02:36:48,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:36:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-08 02:36:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-08 02:36:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 02:36:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-08 02:36:48,480 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-08 02:36:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:48,481 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-08 02:36:48,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 02:36:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-08 02:36:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 02:36:48,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:48,482 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:48,482 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:48,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1256854675, now seen corresponding path program 40 times [2019-09-08 02:36:48,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:48,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:48,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:48,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:48,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:49,174 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-08 02:36:49,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:49,174 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) [2019-09-08 02:36:49,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:36:49,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:36:49,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:49,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 02:36:49,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:49,268 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-08 02:36:49,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:49,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-08 02:36:49,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 02:36:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 02:36:49,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:36:49,272 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2019-09-08 02:36:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:49,417 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-09-08 02:36:49,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 02:36:49,418 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-09-08 02:36:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:49,419 INFO L225 Difference]: With dead ends: 102 [2019-09-08 02:36:49,419 INFO L226 Difference]: Without dead ends: 96 [2019-09-08 02:36:49,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:36:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-08 02:36:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-08 02:36:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-08 02:36:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-08 02:36:49,425 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-08 02:36:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:49,425 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-08 02:36:49,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 02:36:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-08 02:36:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 02:36:49,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:49,426 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:49,427 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1792254193, now seen corresponding path program 41 times [2019-09-08 02:36:49,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:49,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:49,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:49,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:49,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:50,119 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-08 02:36:50,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:50,120 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-08 02:36:50,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:36:51,929 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-08 02:36:51,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:36:51,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:36:51,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:36:51,995 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-08 02:36:52,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:36:52,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-08 02:36:52,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 02:36:52,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 02:36:52,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:36:52,005 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2019-09-08 02:36:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:36:52,119 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-09-08 02:36:52,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 02:36:52,121 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2019-09-08 02:36:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:36:52,122 INFO L225 Difference]: With dead ends: 104 [2019-09-08 02:36:52,122 INFO L226 Difference]: Without dead ends: 98 [2019-09-08 02:36:52,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:36:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-08 02:36:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-08 02:36:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-08 02:36:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-08 02:36:52,126 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-08 02:36:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:36:52,127 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-08 02:36:52,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 02:36:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-08 02:36:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 02:36:52,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:36:52,128 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:36:52,128 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:36:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:36:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash -915115471, now seen corresponding path program 42 times [2019-09-08 02:36:52,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:36:52,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:36:52,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:52,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:36:52,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:36:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:36:52,875 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-08 02:36:52,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:36:52,875 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-08 02:36:52,885 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:37:45,775 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-08 02:37:45,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:45,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 02:37:45,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:45,833 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-08 02:37:45,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:45,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-08 02:37:45,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 02:37:45,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 02:37:45,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:37:45,854 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2019-09-08 02:37:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:46,026 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-09-08 02:37:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 02:37:46,032 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-08 02:37:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:46,033 INFO L225 Difference]: With dead ends: 106 [2019-09-08 02:37:46,033 INFO L226 Difference]: Without dead ends: 100 [2019-09-08 02:37:46,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:37:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-08 02:37:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-08 02:37:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-08 02:37:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-08 02:37:46,037 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-08 02:37:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:46,038 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-08 02:37:46,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 02:37:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-08 02:37:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 02:37:46,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:46,039 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:46,039 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:46,040 INFO L82 PathProgramCache]: Analyzing trace with hash 201606355, now seen corresponding path program 43 times [2019-09-08 02:37:46,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:46,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:46,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:46,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:46,966 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-08 02:37:46,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:46,967 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-08 02:37:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:47,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 02:37:47,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:37:47,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:47,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-08 02:37:47,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 02:37:47,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 02:37:47,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:37:47,071 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2019-09-08 02:37:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:47,244 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-09-08 02:37:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 02:37:47,244 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2019-09-08 02:37:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:47,245 INFO L225 Difference]: With dead ends: 108 [2019-09-08 02:37:47,245 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 02:37:47,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:37:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 02:37:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-08 02:37:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-08 02:37:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-08 02:37:47,249 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-08 02:37:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:47,250 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-08 02:37:47,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 02:37:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-08 02:37:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 02:37:47,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:47,251 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:47,251 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:47,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash -370542859, now seen corresponding path program 44 times [2019-09-08 02:37:47,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:47,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:47,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:37:47,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:48,047 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-08 02:37:48,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:48,047 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-08 02:37:48,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:37:48,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:37:48,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:37:48,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 02:37:48,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:37:48,140 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-08 02:37:48,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:37:48,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-08 02:37:48,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 02:37:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 02:37:48,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:37:48,144 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2019-09-08 02:37:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:37:48,299 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-09-08 02:37:48,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 02:37:48,300 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2019-09-08 02:37:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:37:48,301 INFO L225 Difference]: With dead ends: 110 [2019-09-08 02:37:48,301 INFO L226 Difference]: Without dead ends: 104 [2019-09-08 02:37:48,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:37:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-08 02:37:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-08 02:37:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 02:37:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-08 02:37:48,306 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-08 02:37:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:37:48,307 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-08 02:37:48,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 02:37:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-08 02:37:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 02:37:48,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:37:48,308 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:37:48,308 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:37:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:37:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash -450123625, now seen corresponding path program 45 times [2019-09-08 02:37:48,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:37:48,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:37:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:48,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:37:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:37:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:37:49,137 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-08 02:37:49,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:37:49,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 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-08 02:37:49,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:39:22,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-08 02:39:22,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:22,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 02:39:22,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:22,582 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-08 02:39:22,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:22,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-08 02:39:22,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 02:39:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 02:39:22,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 02:39:22,598 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2019-09-08 02:39:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:22,760 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-09-08 02:39:22,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 02:39:22,761 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2019-09-08 02:39:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:22,762 INFO L225 Difference]: With dead ends: 112 [2019-09-08 02:39:22,762 INFO L226 Difference]: Without dead ends: 106 [2019-09-08 02:39:22,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 02:39:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-08 02:39:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-08 02:39:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-08 02:39:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-08 02:39:22,766 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-08 02:39:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:22,767 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-08 02:39:22,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 02:39:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-08 02:39:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 02:39:22,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:22,768 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:22,768 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash 382171577, now seen corresponding path program 46 times [2019-09-08 02:39:22,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:22,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:22,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:23,651 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-08 02:39:23,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:23,651 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-08 02:39:23,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:39:23,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:39:23,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:23,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 02:39:23,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Stream closed [2019-09-08 02:39:23,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:23,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-08 02:39:23,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 02:39:23,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 02:39:23,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:39:23,756 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2019-09-08 02:39:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:23,911 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-09-08 02:39:23,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 02:39:23,916 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-08 02:39:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:23,917 INFO L225 Difference]: With dead ends: 114 [2019-09-08 02:39:23,917 INFO L226 Difference]: Without dead ends: 108 [2019-09-08 02:39:23,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:39:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-08 02:39:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-08 02:39:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-08 02:39:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-08 02:39:23,922 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-08 02:39:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:23,922 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-08 02:39:23,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 02:39:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-08 02:39:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 02:39:23,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:23,923 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:23,923 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:23,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1353943643, now seen corresponding path program 47 times [2019-09-08 02:39:23,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:23,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:23,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:23,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:23,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:25,120 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-08 02:39:25,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:25,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:39:25,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:39:27,434 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-08 02:39:27,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:39:27,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:39:27,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:39:27,468 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-08 02:39:27,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:39:27,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-08 02:39:27,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 02:39:27,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 02:39:27,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:39:27,476 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2019-09-08 02:39:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:39:27,687 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-09-08 02:39:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 02:39:27,688 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-09-08 02:39:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:39:27,689 INFO L225 Difference]: With dead ends: 116 [2019-09-08 02:39:27,689 INFO L226 Difference]: Without dead ends: 110 [2019-09-08 02:39:27,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:39:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-08 02:39:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-08 02:39:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-08 02:39:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-08 02:39:27,693 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-08 02:39:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:39:27,693 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-08 02:39:27,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 02:39:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-08 02:39:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 02:39:27,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:39:27,695 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:39:27,695 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:39:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:39:27,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1075971459, now seen corresponding path program 48 times [2019-09-08 02:39:27,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:39:27,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:39:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:27,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:39:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:39:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:39:28,674 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-08 02:39:28,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:39:28,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:39:28,693 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:41:23,520 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-08 02:41:23,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:23,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 02:41:23,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:23,590 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-08 02:41:23,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:23,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-08 02:41:23,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 02:41:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 02:41:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 02:41:23,616 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2019-09-08 02:41:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:23,775 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-09-08 02:41:23,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 02:41:23,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2019-09-08 02:41:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:23,777 INFO L225 Difference]: With dead ends: 118 [2019-09-08 02:41:23,777 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 02:41:23,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 02:41:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 02:41:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-08 02:41:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-08 02:41:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-08 02:41:23,781 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-08 02:41:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:23,781 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-08 02:41:23,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 02:41:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-08 02:41:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 02:41:23,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:23,782 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:23,782 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:23,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:23,783 INFO L82 PathProgramCache]: Analyzing trace with hash 237824543, now seen corresponding path program 49 times [2019-09-08 02:41:23,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:23,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:23,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:23,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:23,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:24,747 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-08 02:41:24,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:24,747 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-08 02:41:24,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:24,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 02:41:24,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:41:24,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:24,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-08 02:41:24,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 02:41:24,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 02:41:24,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:41:24,865 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2019-09-08 02:41:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:25,031 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-09-08 02:41:25,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 02:41:25,032 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2019-09-08 02:41:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:25,033 INFO L225 Difference]: With dead ends: 120 [2019-09-08 02:41:25,033 INFO L226 Difference]: Without dead ends: 114 [2019-09-08 02:41:25,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:41:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-08 02:41:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-08 02:41:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 02:41:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-08 02:41:25,038 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-08 02:41:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:25,038 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-08 02:41:25,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 02:41:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-08 02:41:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 02:41:25,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:25,039 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:25,039 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash 75397441, now seen corresponding path program 50 times [2019-09-08 02:41:25,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:25,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:25,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:25,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:26,069 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-08 02:41:26,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:26,069 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-08 02:41:26,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:41:26,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:41:26,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:26,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 02:41:26,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:26,169 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-08 02:41:26,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:26,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-08 02:41:26,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 02:41:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 02:41:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 02:41:26,175 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2019-09-08 02:41:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:26,340 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-09-08 02:41:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 02:41:26,341 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-08 02:41:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:26,342 INFO L225 Difference]: With dead ends: 122 [2019-09-08 02:41:26,342 INFO L226 Difference]: Without dead ends: 116 [2019-09-08 02:41:26,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 02:41:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-08 02:41:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-08 02:41:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-08 02:41:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-08 02:41:26,346 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-08 02:41:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:26,346 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-08 02:41:26,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 02:41:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-08 02:41:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 02:41:26,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:26,347 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:26,348 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1398224925, now seen corresponding path program 51 times [2019-09-08 02:41:26,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:26,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:26,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:27,385 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-08 02:41:27,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:27,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 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-08 02:41:27,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:44:19,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-08 02:44:19,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:44:19,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 02:44:19,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:44:19,072 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-08 02:44:19,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:44:19,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-08 02:44:19,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 02:44:19,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 02:44:19,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:44:19,096 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2019-09-08 02:44:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:44:19,327 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-09-08 02:44:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 02:44:19,327 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-09-08 02:44:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:44:19,328 INFO L225 Difference]: With dead ends: 124 [2019-09-08 02:44:19,328 INFO L226 Difference]: Without dead ends: 118 [2019-09-08 02:44:19,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:44:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-08 02:44:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-08 02:44:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-08 02:44:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-08 02:44:19,333 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-08 02:44:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:44:19,333 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-08 02:44:19,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 02:44:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-08 02:44:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 02:44:19,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:44:19,335 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:44:19,335 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:44:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:44:19,336 INFO L82 PathProgramCache]: Analyzing trace with hash -210110971, now seen corresponding path program 52 times [2019-09-08 02:44:19,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:44:19,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:44:19,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:19,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:44:19,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:20,403 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-08 02:44:20,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:20,403 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-08 02:44:20,424 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-08 02:44:20,487 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:44:20,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:44:20,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 02:44:20,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:44:20,529 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-08 02:44:20,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:44:20,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-08 02:44:20,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 02:44:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 02:44:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:44:20,534 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2019-09-08 02:44:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:44:20,756 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-09-08 02:44:20,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 02:44:20,757 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-09-08 02:44:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:44:20,758 INFO L225 Difference]: With dead ends: 126 [2019-09-08 02:44:20,758 INFO L226 Difference]: Without dead ends: 120 [2019-09-08 02:44:20,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:44:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-08 02:44:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-08 02:44:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-08 02:44:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-08 02:44:20,763 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-08 02:44:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:44:20,763 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-08 02:44:20,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 02:44:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-08 02:44:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 02:44:20,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:44:20,764 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:44:20,764 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:44:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:44:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash -893901913, now seen corresponding path program 53 times [2019-09-08 02:44:20,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:44:20,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:44:20,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:20,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:44:20,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:21,881 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-08 02:44:21,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:21,881 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-08 02:44:21,894 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:44:25,547 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-08 02:44:25,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:44:25,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:44:25,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:44:25,590 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-08 02:44:25,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:44:25,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-08 02:44:25,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 02:44:25,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 02:44:25,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:44:25,600 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2019-09-08 02:44:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:44:25,782 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-09-08 02:44:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 02:44:25,786 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-08 02:44:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:44:25,787 INFO L225 Difference]: With dead ends: 128 [2019-09-08 02:44:25,788 INFO L226 Difference]: Without dead ends: 122 [2019-09-08 02:44:25,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:44:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-08 02:44:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-08 02:44:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-08 02:44:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-08 02:44:25,792 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-08 02:44:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:44:25,792 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-08 02:44:25,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 02:44:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-08 02:44:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 02:44:25,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:44:25,794 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:44:25,794 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:44:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:44:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash -887000887, now seen corresponding path program 54 times [2019-09-08 02:44:25,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:44:25,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:44:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:25,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:44:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:44:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:44:26,930 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-08 02:44:26,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:44:26,930 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-08 02:44:26,946 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:47:11,403 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-08 02:47:11,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:47:11,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 02:47:11,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:47:11,486 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-08 02:47:11,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:47:11,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-08 02:47:11,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 02:47:11,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 02:47:11,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:47:11,513 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2019-09-08 02:47:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:47:11,689 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-09-08 02:47:11,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 02:47:11,690 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-08 02:47:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:47:11,691 INFO L225 Difference]: With dead ends: 130 [2019-09-08 02:47:11,691 INFO L226 Difference]: Without dead ends: 124 [2019-09-08 02:47:11,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:47:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-08 02:47:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-08 02:47:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-08 02:47:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-08 02:47:11,695 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-08 02:47:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:47:11,695 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-08 02:47:11,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 02:47:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-08 02:47:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 02:47:11,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:47:11,696 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:47:11,696 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:47:11,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:47:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1449917803, now seen corresponding path program 55 times [2019-09-08 02:47:11,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:47:11,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:47:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:47:11,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:47:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:47:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:47:12,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-08 02:47:12,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:47:12,894 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-08 02:47:12,907 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-08 02:47:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:47:12,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 02:47:12,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:47:12,998 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-08 02:47:13,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:47:13,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-08 02:47:13,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 02:47:13,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 02:47:13,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 02:47:13,003 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2019-09-08 02:47:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:47:13,190 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-09-08 02:47:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 02:47:13,191 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2019-09-08 02:47:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:47:13,192 INFO L225 Difference]: With dead ends: 132 [2019-09-08 02:47:13,192 INFO L226 Difference]: Without dead ends: 126 [2019-09-08 02:47:13,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 02:47:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-08 02:47:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-08 02:47:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-08 02:47:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-08 02:47:13,197 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-08 02:47:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:47:13,197 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-08 02:47:13,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 02:47:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-08 02:47:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 02:47:13,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:47:13,198 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:47:13,198 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:47:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:47:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash 960883085, now seen corresponding path program 56 times [2019-09-08 02:47:13,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:47:13,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:47:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:47:13,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:47:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:47:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:47:14,473 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-08 02:47:14,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:47:14,473 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-08 02:47:14,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:47:14,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:47:14,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:47:14,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 02:47:14,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:47:14,580 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-08 02:47:14,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:47:14,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-08 02:47:14,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 02:47:14,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 02:47:14,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 02:47:14,585 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2019-09-08 02:47:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:47:14,809 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-09-08 02:47:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 02:47:14,810 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2019-09-08 02:47:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:47:14,811 INFO L225 Difference]: With dead ends: 134 [2019-09-08 02:47:14,811 INFO L226 Difference]: Without dead ends: 128 [2019-09-08 02:47:14,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 02:47:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-08 02:47:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-08 02:47:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-08 02:47:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-08 02:47:14,826 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-08 02:47:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:47:14,826 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-08 02:47:14,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 02:47:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-08 02:47:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 02:47:14,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:47:14,827 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:47:14,828 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:47:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:47:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash -850045649, now seen corresponding path program 57 times [2019-09-08 02:47:14,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:47:14,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:47:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:47:14,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:47:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:47:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:47:16,156 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-08 02:47:16,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:47:16,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 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-08 02:47:16,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2