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/diamond_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:34:07,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:34:07,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:34:07,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:34:07,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:34:07,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:34:07,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:34:07,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:34:07,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:34:07,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:34:07,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:34:07,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:34:07,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:34:07,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:34:07,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:34:07,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:34:07,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:34:07,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:34:07,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:34:07,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:34:07,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:34:07,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:34:07,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:34:07,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:34:07,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:34:07,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:34:07,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:34:07,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:34:07,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:34:07,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:34:07,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:34:07,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:34:07,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:34:07,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:34:07,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:34:07,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:34:07,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:34:07,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:34:07,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:34:07,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:34:07,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:34:07,879 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-03 19:34:07,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:34:07,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:34:07,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:34:07,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:34:07,894 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:34:07,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:34:07,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:34:07,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:34:07,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:34:07,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:34:07,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:34:07,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:34:07,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:34:07,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:34:07,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:34:07,896 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:34:07,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:34:07,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:34:07,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:34:07,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:34:07,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:34:07,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:34:07,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:34:07,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:34:07,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:34:07,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:34:07,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:34:07,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:34:07,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:34:07,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:34:07,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:34:07,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:34:07,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:34:07,957 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:34:07,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2019-09-03 19:34:08,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22673caba/5a74d634872b4277b4b2d9eb6868e22b/FLAGbfab23450 [2019-09-03 19:34:08,470 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:34:08,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2019-09-03 19:34:08,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22673caba/5a74d634872b4277b4b2d9eb6868e22b/FLAGbfab23450 [2019-09-03 19:34:08,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22673caba/5a74d634872b4277b4b2d9eb6868e22b [2019-09-03 19:34:08,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:34:08,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:34:08,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:34:08,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:34:08,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:34:08,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:34:08" (1/1) ... [2019-09-03 19:34:08,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18230a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:08, skipping insertion in model container [2019-09-03 19:34:08,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:34:08" (1/1) ... [2019-09-03 19:34:08,859 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:34:08,877 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:34:09,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:34:09,039 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:34:09,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:34:09,067 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:34:09,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09 WrapperNode [2019-09-03 19:34:09,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:34:09,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:34:09,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:34:09,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:34:09,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (1/1) ... [2019-09-03 19:34:09,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (1/1) ... [2019-09-03 19:34:09,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (1/1) ... [2019-09-03 19:34:09,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (1/1) ... [2019-09-03 19:34:09,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (1/1) ... [2019-09-03 19:34:09,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (1/1) ... [2019-09-03 19:34:09,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (1/1) ... [2019-09-03 19:34:09,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:34:09,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:34:09,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:34:09,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:34:09,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (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-03 19:34:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:34:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:34:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:34:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:34:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:34:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:34:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:34:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:34:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:34:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:34:09,406 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:34:09,407 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:34:09,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:34:09 BoogieIcfgContainer [2019-09-03 19:34:09,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:34:09,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:34:09,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:34:09,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:34:09,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:34:08" (1/3) ... [2019-09-03 19:34:09,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e59ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:34:09, skipping insertion in model container [2019-09-03 19:34:09,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:09" (2/3) ... [2019-09-03 19:34:09,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e59ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:34:09, skipping insertion in model container [2019-09-03 19:34:09,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:34:09" (3/3) ... [2019-09-03 19:34:09,415 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2019-09-03 19:34:09,424 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:34:09,432 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:34:09,448 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:34:09,478 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:34:09,479 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:34:09,479 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:34:09,479 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:34:09,479 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:34:09,479 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:34:09,479 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:34:09,479 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:34:09,480 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:34:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-03 19:34:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:34:09,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:09,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:09,502 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-03 19:34:09,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:09,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:09,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:09,596 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-03 19:34:09,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:34:09,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:34:09,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:34:09,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:34:09,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:34:09,615 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-03 19:34:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:09,636 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-03 19:34:09,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:34:09,638 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 19:34:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:09,646 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:34:09,646 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:34:09,649 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-03 19:34:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:34:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:34:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:34:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 19:34:09,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 19:34:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:09,682 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 19:34:09,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:34:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 19:34:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:34:09,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:09,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:09,683 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-03 19:34:09,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:09,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:09,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:09,913 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-09-03 19:34:09,926 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-03 19:34:09,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:34:09,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:34:09,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:34:09,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:34:09,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:34:09,929 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 19:34:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:09,988 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-09-03 19:34:09,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:34:09,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:34:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:09,991 INFO L225 Difference]: With dead ends: 19 [2019-09-03 19:34:09,991 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:34:09,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:34:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:34:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-03 19:34:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 19:34:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-03 19:34:10,000 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-03 19:34:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:10,000 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-03 19:34:10,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:34:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-03 19:34:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:34:10,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:10,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:10,002 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-03 19:34:10,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:10,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:10,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:10,162 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-03 19:34:10,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:10,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:10,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:10,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:34:10,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:10,246 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-03 19:34:10,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:10,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:34:10,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:34:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:34:10,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:34:10,253 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-09-03 19:34:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:10,320 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-09-03 19:34:10,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:34:10,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 19:34:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:10,323 INFO L225 Difference]: With dead ends: 21 [2019-09-03 19:34:10,325 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:34:10,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:34:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:34:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 19:34:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:34:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-03 19:34:10,332 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-03 19:34:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:10,332 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-03 19:34:10,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:34:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-03 19:34:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:34:10,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:10,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:10,334 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:10,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1025597645, now seen corresponding path program 1 times [2019-09-03 19:34:10,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:10,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:10,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:10,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:10,457 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-03 19:34:10,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:10,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:10,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:10,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:34:10,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:10,517 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-03 19:34:10,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:10,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:34:10,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:34:10,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:34:10,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:34:10,525 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-09-03 19:34:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:10,575 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-03 19:34:10,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:34:10,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 19:34:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:10,577 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:34:10,578 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:34:10,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:34:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:34:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-09-03 19:34:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:34:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-03 19:34:10,584 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-03 19:34:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:10,584 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-03 19:34:10,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:34:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-03 19:34:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:34:10,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:10,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:10,586 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:10,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-03 19:34:10,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:10,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:10,684 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-03 19:34:10,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:10,685 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-03 19:34:10,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:34:10,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:10,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:10,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:34:10,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:10,747 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-03 19:34:10,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:10,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:34:10,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:34:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:34:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:34:10,752 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2019-09-03 19:34:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:10,820 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-09-03 19:34:10,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:34:10,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 19:34:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:10,822 INFO L225 Difference]: With dead ends: 24 [2019-09-03 19:34:10,822 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:34:10,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:34:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:34:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-09-03 19:34:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:34:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-09-03 19:34:10,829 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-09-03 19:34:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:10,830 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-09-03 19:34:10,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:34:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-09-03 19:34:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:34:10,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:10,832 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:10,832 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -109889104, now seen corresponding path program 1 times [2019-09-03 19:34:10,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:10,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:10,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:10,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:10,972 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-03 19:34:10,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:10,973 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-03 19:34:10,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:11,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-03 19:34:11,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:11,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:34:11,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-03 19:34:11,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:34:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:34:11,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:34:11,043 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2019-09-03 19:34:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:11,110 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-09-03 19:34:11,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:34:11,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 19:34:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:11,113 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:34:11,113 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:34:11,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:34:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:34:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-09-03 19:34:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 19:34:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-09-03 19:34:11,119 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-09-03 19:34:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:11,120 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-09-03 19:34:11,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:34:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-09-03 19:34:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:34:11,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:11,121 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:11,121 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:11,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash -976494032, now seen corresponding path program 2 times [2019-09-03 19:34:11,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:11,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:11,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:11,182 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-03 19:34:11,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:11,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:11,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:34:11,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:11,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:11,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-03 19:34:11,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:11,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:34:11,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-03 19:34:11,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:34:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:34:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:34:11,247 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 6 states. [2019-09-03 19:34:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:11,309 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-03 19:34:11,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:34:11,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 19:34:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:11,311 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:34:11,311 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:34:11,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:34:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:34:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-03 19:34:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 19:34:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-03 19:34:11,321 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2019-09-03 19:34:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:11,322 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-03 19:34:11,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:34:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-03 19:34:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:34:11,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:11,324 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:11,324 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash -919235730, now seen corresponding path program 2 times [2019-09-03 19:34:11,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:11,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:11,411 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-03 19:34:11,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:11,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:11,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:11,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:11,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:11,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:34:11,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:11,456 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-03 19:34:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:34:11,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:34:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:34:11,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:34:11,461 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2019-09-03 19:34:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:11,511 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-09-03 19:34:11,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:34:11,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 19:34:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:11,512 INFO L225 Difference]: With dead ends: 28 [2019-09-03 19:34:11,512 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:34:11,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:34:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:34:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-03 19:34:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:34:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-03 19:34:11,518 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-09-03 19:34:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:11,518 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-03 19:34:11,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:34:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-03 19:34:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:34:11,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:11,519 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:11,519 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:11,520 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2019-09-03 19:34:11,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:11,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:11,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:11,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:11,599 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-03 19:34:11,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:11,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:11,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:11,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:34:11,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:11,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:34:11,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:11,653 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-03 19:34:11,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:11,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:34:11,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:34:11,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:34:11,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:34:11,658 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2019-09-03 19:34:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:11,725 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-03 19:34:11,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:34:11,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 19:34:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:11,727 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:34:11,727 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:34:11,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:34:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:34:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-03 19:34:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:34:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-03 19:34:11,740 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-03 19:34:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:11,740 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-03 19:34:11,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:34:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-03 19:34:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:34:11,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:11,744 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:11,744 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 3 times [2019-09-03 19:34:11,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:11,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:11,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:11,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:11,838 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-03 19:34:11,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:11,838 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:11,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:34:11,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:34:11,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:11,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:34:11,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:11,904 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-03 19:34:11,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:11,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:34:11,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:34:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:34:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:34:11,911 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-03 19:34:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:11,970 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-03 19:34:11,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:34:11,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 19:34:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:11,974 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:34:11,975 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:34:11,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:34:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:34:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-03 19:34:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:34:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-03 19:34:11,984 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-09-03 19:34:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:11,986 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-03 19:34:11,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:34:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-03 19:34:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:34:11,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:11,987 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:11,987 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 4 times [2019-09-03 19:34:11,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:11,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:11,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:12,108 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-03 19:34:12,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:12,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:12,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:12,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:12,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:12,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:34:12,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:34:12,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:12,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:34:12,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:34:12,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:34:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:34:12,168 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-09-03 19:34:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:12,260 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-03 19:34:12,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:34:12,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-03 19:34:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:12,261 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:34:12,262 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:34:12,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:34:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:34:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-03 19:34:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 19:34:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-03 19:34:12,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2019-09-03 19:34:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:12,267 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-03 19:34:12,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:34:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-03 19:34:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:34:12,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:12,268 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:12,268 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash -224607324, now seen corresponding path program 4 times [2019-09-03 19:34:12,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:12,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:12,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:12,366 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-03 19:34:12,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:12,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:12,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:12,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:12,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:12,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:34:12,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:12,409 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-03 19:34:12,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:12,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:34:12,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:34:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:34:12,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:34:12,413 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2019-09-03 19:34:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:12,489 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-03 19:34:12,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:34:12,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-03 19:34:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:12,491 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:34:12,491 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:34:12,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:34:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:34:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 19:34:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:34:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-03 19:34:12,496 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-09-03 19:34:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:12,496 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-03 19:34:12,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:34:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-03 19:34:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:34:12,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:12,498 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:12,498 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1931383913, now seen corresponding path program 5 times [2019-09-03 19:34:12,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:12,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:12,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:12,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:12,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:12,614 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-03 19:34:12,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:12,614 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-03 19:34:12,637 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-03 19:34:12,667 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:34:12,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:12,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:34:12,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:12,690 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-03 19:34:12,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:12,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:34:12,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:34:12,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:34:12,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:34:12,695 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-09-03 19:34:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:12,775 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-03 19:34:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:34:12,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 19:34:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:12,777 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:34:12,777 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:34:12,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:34:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:34:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-03 19:34:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:34:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-03 19:34:12,782 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-09-03 19:34:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:12,782 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-03 19:34:12,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:34:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-03 19:34:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:34:12,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:12,783 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:12,783 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 33316767, now seen corresponding path program 5 times [2019-09-03 19:34:12,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:12,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:12,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:12,871 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-03 19:34:12,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:12,871 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-03 19:34:12,888 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:34:13,022 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:34:13,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:13,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:34:13,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:13,058 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-03 19:34:13,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:13,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:34:13,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:34:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:34:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:34:13,063 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2019-09-03 19:34:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:13,144 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-03 19:34:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:34:13,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 19:34:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:13,145 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:34:13,145 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:34:13,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:34:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:34:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-03 19:34:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:34:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-03 19:34:13,150 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2019-09-03 19:34:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:13,151 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-03 19:34:13,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:34:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-03 19:34:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:34:13,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:13,152 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:13,152 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:13,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1709400550, now seen corresponding path program 6 times [2019-09-03 19:34:13,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:13,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:13,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:13,242 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-03 19:34:13,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:13,242 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-03 19:34:13,252 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:34:13,270 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:34:13,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:13,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:34:13,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:13,319 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-03 19:34:13,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:13,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:34:13,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:34:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:34:13,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:34:13,323 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2019-09-03 19:34:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:13,438 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-03 19:34:13,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:34:13,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-03 19:34:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:13,440 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:34:13,440 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:34:13,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:34:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:34:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-03 19:34:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 19:34:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-03 19:34:13,448 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2019-09-03 19:34:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:13,449 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-03 19:34:13,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:34:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-03 19:34:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:34:13,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:13,450 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:13,450 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1209734950, now seen corresponding path program 6 times [2019-09-03 19:34:13,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:13,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:13,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:13,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:13,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:13,546 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-03 19:34:13,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:13,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:13,565 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:13,585 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:34:13,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:13,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:34:13,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:13,609 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-03 19:34:13,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:13,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:34:13,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:34:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:34:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:34:13,614 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2019-09-03 19:34:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:13,714 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-03 19:34:13,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:34:13,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-03 19:34:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:13,715 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:34:13,715 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:34:13,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:34:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:34:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-03 19:34:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 19:34:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-03 19:34:13,721 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2019-09-03 19:34:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:13,721 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-03 19:34:13,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:34:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-03 19:34:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:34:13,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:13,722 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:13,722 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1163213789, now seen corresponding path program 7 times [2019-09-03 19:34:13,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:13,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:13,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:13,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:13,831 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-03 19:34:13,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:13,832 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-03 19:34:13,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:13,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:34:13,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:13,891 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-03 19:34:13,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:13,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:34:13,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:34:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:34:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:34:13,895 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 11 states. [2019-09-03 19:34:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:14,018 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-03 19:34:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:34:14,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-03 19:34:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:14,019 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:34:14,019 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:34:14,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:34:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:34:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-03 19:34:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:34:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-03 19:34:14,024 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 24 [2019-09-03 19:34:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:14,025 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-03 19:34:14,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:34:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-03 19:34:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:34:14,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:14,026 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:14,026 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1781526699, now seen corresponding path program 7 times [2019-09-03 19:34:14,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:14,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:14,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:14,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:14,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:14,121 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-03 19:34:14,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:14,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:14,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:14,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:34:14,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:14,184 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-03 19:34:14,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:14,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:34:14,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:34:14,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:34:14,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:34:14,190 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 11 states. [2019-09-03 19:34:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:14,325 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-03 19:34:14,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:34:14,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-03 19:34:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:14,326 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:34:14,326 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:34:14,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:34:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:34:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-03 19:34:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:34:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-03 19:34:14,339 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2019-09-03 19:34:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:14,339 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-03 19:34:14,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:34:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-03 19:34:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:34:14,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:14,342 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:14,342 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash -81622240, now seen corresponding path program 8 times [2019-09-03 19:34:14,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:14,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:14,480 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-03 19:34:14,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:14,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:14,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:34:14,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:14,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:14,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:34:14,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:14,548 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-03 19:34:14,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:14,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:34:14,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:34:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:34:14,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:34:14,553 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 12 states. [2019-09-03 19:34:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:14,711 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-09-03 19:34:14,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:34:14,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-03 19:34:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:14,712 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:34:14,712 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:34:14,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:34:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:34:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-03 19:34:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:34:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-03 19:34:14,725 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2019-09-03 19:34:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:14,725 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-03 19:34:14,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:34:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-03 19:34:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:34:14,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:14,726 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:14,727 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1517583600, now seen corresponding path program 8 times [2019-09-03 19:34:14,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:14,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:14,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:14,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:14,867 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-03 19:34:14,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:14,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:14,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:34:14,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:14,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:14,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:34:14,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:14,917 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-03 19:34:14,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:14,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:34:14,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:34:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:34:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:34:14,921 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2019-09-03 19:34:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:15,079 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-03 19:34:15,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:34:15,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-03 19:34:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:15,084 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:34:15,084 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:34:15,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:34:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:34:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-03 19:34:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:34:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-03 19:34:15,089 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 26 [2019-09-03 19:34:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:15,089 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-03 19:34:15,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:34:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-03 19:34:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:34:15,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:15,090 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:15,091 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash -54229283, now seen corresponding path program 9 times [2019-09-03 19:34:15,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:15,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:15,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:15,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:15,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:15,241 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-03 19:34:15,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:15,242 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-03 19:34:15,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:34:15,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:34:15,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:15,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:34:15,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:15,329 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-03 19:34:15,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:15,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:34:15,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:34:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:34:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:34:15,334 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 13 states. [2019-09-03 19:34:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:15,585 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-09-03 19:34:15,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:34:15,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-03 19:34:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:15,586 INFO L225 Difference]: With dead ends: 54 [2019-09-03 19:34:15,587 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:34:15,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:34:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:34:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-03 19:34:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:34:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-03 19:34:15,595 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 28 [2019-09-03 19:34:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:15,595 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-03 19:34:15,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:34:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-03 19:34:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:34:15,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:15,596 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:15,597 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1271335925, now seen corresponding path program 9 times [2019-09-03 19:34:15,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:15,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:15,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:15,764 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-03 19:34:15,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:15,765 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-03 19:34:15,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:34:15,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:34:15,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:15,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:34:15,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:15,877 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-03 19:34:15,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:15,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:34:15,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:34:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:34:15,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:34:15,881 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2019-09-03 19:34:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:16,089 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-09-03 19:34:16,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:34:16,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-03 19:34:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:16,097 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:34:16,097 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:34:16,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:34:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:34:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-03 19:34:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:34:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-03 19:34:16,102 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 28 [2019-09-03 19:34:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:16,103 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-03 19:34:16,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:34:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-03 19:34:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:34:16,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:16,104 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:16,104 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:16,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 10 times [2019-09-03 19:34:16,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:16,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:16,252 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-03 19:34:16,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:16,253 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) [2019-09-03 19:34:16,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:16,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:16,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:16,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:34:16,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:16,328 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-03 19:34:16,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:16,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:34:16,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:34:16,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:34:16,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:34:16,332 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2019-09-03 19:34:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:16,586 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-09-03 19:34:16,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:34:16,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-03 19:34:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:16,588 INFO L225 Difference]: With dead ends: 58 [2019-09-03 19:34:16,588 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:34:16,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:34:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:34:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-03 19:34:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:34:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-03 19:34:16,592 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2019-09-03 19:34:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:16,592 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-03 19:34:16,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:34:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-03 19:34:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:34:16,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:16,593 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:16,593 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash -850521530, now seen corresponding path program 10 times [2019-09-03 19:34:16,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:16,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:16,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:16,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:16,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:16,751 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-03 19:34:16,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:16,752 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-03 19:34:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:34:16,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:16,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:16,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:34:16,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:16,804 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-03 19:34:16,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:16,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:34:16,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:34:16,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:34:16,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:34:16,809 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 14 states. [2019-09-03 19:34:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:17,022 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-03 19:34:17,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:34:17,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-03 19:34:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:17,030 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:34:17,030 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 19:34:17,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:34:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 19:34:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-03 19:34:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:34:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-09-03 19:34:17,034 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 30 [2019-09-03 19:34:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:17,034 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-09-03 19:34:17,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:34:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-09-03 19:34:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:34:17,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:17,035 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:17,035 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1114266775, now seen corresponding path program 11 times [2019-09-03 19:34:17,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:17,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:17,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:17,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:17,204 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-03 19:34:17,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:17,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:17,217 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:34:19,376 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:34:19,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:19,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:34:19,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:19,413 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-03 19:34:19,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:19,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:34:19,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:34:19,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:34:19,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:34:19,420 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 15 states. [2019-09-03 19:34:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:19,712 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-09-03 19:34:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:34:19,713 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-03 19:34:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:19,713 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:34:19,713 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 19:34:19,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:34:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 19:34:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-03 19:34:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 19:34:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-03 19:34:19,717 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 32 [2019-09-03 19:34:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:19,717 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-03 19:34:19,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:34:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-03 19:34:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:34:19,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:19,718 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:19,718 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:19,719 INFO L82 PathProgramCache]: Analyzing trace with hash -174813759, now seen corresponding path program 11 times [2019-09-03 19:34:19,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:19,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:19,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:19,879 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-03 19:34:19,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:19,879 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-03 19:34:19,890 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:34:24,051 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:34:24,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:24,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:34:24,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:24,098 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-03 19:34:24,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:24,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:34:24,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:34:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:34:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:34:24,105 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 15 states. [2019-09-03 19:34:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:24,334 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-09-03 19:34:24,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:34:24,335 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-03 19:34:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:24,335 INFO L225 Difference]: With dead ends: 64 [2019-09-03 19:34:24,335 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 19:34:24,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:34:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 19:34:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-03 19:34:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:34:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-03 19:34:24,342 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 32 [2019-09-03 19:34:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:24,342 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-03 19:34:24,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:34:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-03 19:34:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:34:24,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:24,343 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:24,343 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:24,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:24,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1856121196, now seen corresponding path program 12 times [2019-09-03 19:34:24,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:24,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:24,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:24,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:24,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:24,530 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-03 19:34:24,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:24,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:24,544 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:24,854 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:34:24,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:24,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:34:24,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:24,881 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-03 19:34:24,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:24,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:34:24,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:34:24,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:34:24,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:34:24,889 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 16 states. [2019-09-03 19:34:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:25,199 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-09-03 19:34:25,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:34:25,200 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-03 19:34:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:25,201 INFO L225 Difference]: With dead ends: 66 [2019-09-03 19:34:25,201 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 19:34:25,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:34:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 19:34:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-03 19:34:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 19:34:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-03 19:34:25,205 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-09-03 19:34:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:25,206 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-03 19:34:25,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:34:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-03 19:34:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:34:25,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:25,207 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:25,207 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:25,207 INFO L82 PathProgramCache]: Analyzing trace with hash 640292476, now seen corresponding path program 12 times [2019-09-03 19:34:25,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:25,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:25,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:25,441 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-03 19:34:25,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:25,442 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-03 19:34:25,459 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:26,134 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:34:26,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:26,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:34:26,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:26,178 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-03 19:34:26,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:26,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:34:26,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:34:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:34:26,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:34:26,187 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 16 states. [2019-09-03 19:34:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:26,460 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-09-03 19:34:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:34:26,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-03 19:34:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:26,462 INFO L225 Difference]: With dead ends: 68 [2019-09-03 19:34:26,462 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 19:34:26,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:34:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 19:34:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-03 19:34:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 19:34:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-03 19:34:26,467 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-09-03 19:34:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:26,467 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-03 19:34:26,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:34:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-03 19:34:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:34:26,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:26,468 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:26,469 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash -245709487, now seen corresponding path program 13 times [2019-09-03 19:34:26,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:26,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:26,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:26,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:26,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:26,678 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-03 19:34:26,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:26,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:26,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:26,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:34:26,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:26,729 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-03 19:34:26,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:26,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:34:26,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:34:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:34:26,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:34:26,733 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2019-09-03 19:34:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:27,105 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-09-03 19:34:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:34:27,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-03 19:34:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:27,107 INFO L225 Difference]: With dead ends: 70 [2019-09-03 19:34:27,107 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 19:34:27,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:34:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 19:34:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-03 19:34:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 19:34:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-03 19:34:27,112 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 36 [2019-09-03 19:34:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:27,113 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-03 19:34:27,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:34:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-03 19:34:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:34:27,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:27,114 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:27,114 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:27,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2021630857, now seen corresponding path program 13 times [2019-09-03 19:34:27,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:27,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:27,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:27,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:27,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:27,317 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-03 19:34:27,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:27,318 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-03 19:34:27,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:27,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:34:27,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:27,379 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-03 19:34:27,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:27,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:34:27,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:34:27,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:34:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:34:27,384 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2019-09-03 19:34:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:27,655 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-09-03 19:34:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:34:27,655 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-03 19:34:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:27,656 INFO L225 Difference]: With dead ends: 72 [2019-09-03 19:34:27,656 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:34:27,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:34:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:34:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-03 19:34:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 19:34:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-03 19:34:27,661 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 36 [2019-09-03 19:34:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:27,661 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-03 19:34:27,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:34:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-03 19:34:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:34:27,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:27,662 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:27,662 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1171716302, now seen corresponding path program 14 times [2019-09-03 19:34:27,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:27,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:27,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:27,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:27,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:27,865 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-03 19:34:27,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:27,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:27,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:34:27,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:27,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:27,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:34:27,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:27,916 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-03 19:34:27,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:27,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:34:27,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:34:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:34:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:34:27,920 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 18 states. [2019-09-03 19:34:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:28,350 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-09-03 19:34:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:34:28,351 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-03 19:34:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:28,352 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:34:28,352 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 19:34:28,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:34:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 19:34:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-03 19:34:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 19:34:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-03 19:34:28,356 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 38 [2019-09-03 19:34:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:28,357 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-03 19:34:28,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:34:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-03 19:34:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:34:28,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:28,357 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:28,357 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:28,358 INFO L82 PathProgramCache]: Analyzing trace with hash -329445454, now seen corresponding path program 14 times [2019-09-03 19:34:28,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:28,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:28,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:28,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:28,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:28,564 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-03 19:34:28,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:28,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:28,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:28,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:28,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:28,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:34:28,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:28,667 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-03 19:34:28,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:28,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:34:28,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:34:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:34:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:34:28,672 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 18 states. [2019-09-03 19:34:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:29,002 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-09-03 19:34:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:34:29,003 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-03 19:34:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:29,004 INFO L225 Difference]: With dead ends: 76 [2019-09-03 19:34:29,004 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 19:34:29,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:34:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 19:34:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-03 19:34:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:34:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-09-03 19:34:29,011 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 38 [2019-09-03 19:34:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:29,012 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-09-03 19:34:29,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:34:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-09-03 19:34:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:34:29,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:29,013 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:29,013 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:29,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:29,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1813266699, now seen corresponding path program 15 times [2019-09-03 19:34:29,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:29,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:29,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:29,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:29,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:29,290 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-03 19:34:29,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:29,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 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-03 19:34:29,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:34:30,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:34:30,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:30,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:34:30,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:30,350 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-03 19:34:30,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:30,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 19:34:30,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:34:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:34:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:34:30,356 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2019-09-03 19:34:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:30,808 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-09-03 19:34:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:34:30,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-03 19:34:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:30,810 INFO L225 Difference]: With dead ends: 78 [2019-09-03 19:34:30,810 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 19:34:30,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:34:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 19:34:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-09-03 19:34:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 19:34:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-03 19:34:30,814 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 40 [2019-09-03 19:34:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:30,814 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-03 19:34:30,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:34:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-03 19:34:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:34:30,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:30,815 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:30,815 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1931878355, now seen corresponding path program 15 times [2019-09-03 19:34:30,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:30,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:30,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:31,035 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-03 19:34:31,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:31,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:31,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:35,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:34:35,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:35,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:34:35,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:35,871 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-03 19:34:35,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 19:34:35,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:34:35,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:34:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:34:35,878 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 19 states. [2019-09-03 19:34:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:36,270 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-09-03 19:34:36,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:34:36,271 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-03 19:34:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:36,272 INFO L225 Difference]: With dead ends: 80 [2019-09-03 19:34:36,272 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 19:34:36,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:34:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 19:34:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-09-03 19:34:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 19:34:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-09-03 19:34:36,276 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 40 [2019-09-03 19:34:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:36,277 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-09-03 19:34:36,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:34:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-09-03 19:34:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:34:36,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:36,277 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:36,278 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:36,278 INFO L82 PathProgramCache]: Analyzing trace with hash -132092408, now seen corresponding path program 16 times [2019-09-03 19:34:36,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:36,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:36,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:36,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:36,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:36,563 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-03 19:34:36,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:36,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:36,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:36,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:36,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:36,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:34:36,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:36,648 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-03 19:34:36,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:36,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:34:36,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:34:36,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:34:36,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:34:36,652 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 20 states. [2019-09-03 19:34:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:37,151 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-09-03 19:34:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:34:37,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-03 19:34:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:37,153 INFO L225 Difference]: With dead ends: 82 [2019-09-03 19:34:37,153 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 19:34:37,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:34:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 19:34:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-03 19:34:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 19:34:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-03 19:34:37,158 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2019-09-03 19:34:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:37,159 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-03 19:34:37,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:34:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-03 19:34:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:34:37,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:37,160 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:37,160 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:37,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash 23363048, now seen corresponding path program 16 times [2019-09-03 19:34:37,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:37,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:37,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:37,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:37,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:37,412 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-03 19:34:37,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:37,412 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-03 19:34:37,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:34:37,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:37,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:37,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:34:37,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:37,468 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-03 19:34:37,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:37,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:34:37,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:34:37,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:34:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:34:37,471 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 20 states. [2019-09-03 19:34:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:37,917 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-09-03 19:34:37,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:34:37,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-03 19:34:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:37,919 INFO L225 Difference]: With dead ends: 84 [2019-09-03 19:34:37,919 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 19:34:37,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:34:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 19:34:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-03 19:34:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 19:34:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-03 19:34:37,925 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 42 [2019-09-03 19:34:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:37,925 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-03 19:34:37,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:34:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-03 19:34:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:34:37,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:37,926 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:37,927 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1311420475, now seen corresponding path program 17 times [2019-09-03 19:34:37,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:37,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:37,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:38,210 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-03 19:34:38,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:38,210 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-03 19:34:38,220 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:35:43,479 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 19:35:43,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:35:44,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:35:44,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:35:44,071 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-03 19:35:44,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:35:44,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:35:44,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:35:44,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:35:44,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:35:44,079 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 21 states. [2019-09-03 19:35:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:35:44,673 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-09-03 19:35:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:35:44,673 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-03 19:35:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:35:44,674 INFO L225 Difference]: With dead ends: 86 [2019-09-03 19:35:44,674 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 19:35:44,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:35:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 19:35:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-09-03 19:35:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:35:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-09-03 19:35:44,681 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 44 [2019-09-03 19:35:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:35:44,681 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-09-03 19:35:44,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:35:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-09-03 19:35:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:35:44,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:35:44,682 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:35:44,682 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:35:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:35:44,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2109642979, now seen corresponding path program 17 times [2019-09-03 19:35:44,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:35:44,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:35:44,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:44,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:35:44,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:35:44,956 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-03 19:35:44,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:35:44,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:35:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:36:34,297 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 19:36:34,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:34,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:36:34,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:34,418 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-03 19:36:34,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:34,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:36:34,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:36:34,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:36:34,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:36:34,425 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 21 states. [2019-09-03 19:36:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:34,901 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-09-03 19:36:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:36:34,907 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-03 19:36:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:34,908 INFO L225 Difference]: With dead ends: 88 [2019-09-03 19:36:34,908 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 19:36:34,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:36:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 19:36:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-09-03 19:36:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 19:36:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-09-03 19:36:34,913 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 44 [2019-09-03 19:36:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:34,913 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-09-03 19:36:34,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:36:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-09-03 19:36:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:36:34,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:34,914 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:34,914 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash -774326718, now seen corresponding path program 18 times [2019-09-03 19:36:34,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:34,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:34,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:35,192 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-03 19:36:35,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:35,192 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-03 19:36:35,202 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:36:35,683 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:36:35,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:35,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:36:35,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:35,736 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-03 19:36:35,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:35,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:36:35,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:36:35,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:36:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:36:35,741 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 22 states. [2019-09-03 19:36:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:36,402 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-09-03 19:36:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:36:36,402 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-03 19:36:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:36,403 INFO L225 Difference]: With dead ends: 90 [2019-09-03 19:36:36,403 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 19:36:36,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:36:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 19:36:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-03 19:36:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-03 19:36:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-03 19:36:36,406 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 46 [2019-09-03 19:36:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:36,407 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-03 19:36:36,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:36:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-03 19:36:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:36:36,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:36,408 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:36,408 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1274929438, now seen corresponding path program 18 times [2019-09-03 19:36:36,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:36,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:36,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:36,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:36,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:36,695 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-03 19:36:36,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:36,696 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-03 19:36:36,706 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:36:40,713 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:36:40,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:40,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:36:40,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:40,758 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-03 19:36:40,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:40,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:36:40,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:36:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:36:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:36:40,764 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 22 states. [2019-09-03 19:36:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:41,288 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-09-03 19:36:41,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:36:41,289 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-03 19:36:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:41,290 INFO L225 Difference]: With dead ends: 92 [2019-09-03 19:36:41,290 INFO L226 Difference]: Without dead ends: 87 [2019-09-03 19:36:41,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:36:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-03 19:36:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-09-03 19:36:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 19:36:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-09-03 19:36:41,294 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 46 [2019-09-03 19:36:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:41,295 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-09-03 19:36:41,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:36:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-09-03 19:36:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:36:41,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:41,295 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:41,295 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash -23301761, now seen corresponding path program 19 times [2019-09-03 19:36:41,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:41,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:41,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:41,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:41,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:41,611 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-03 19:36:41,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:41,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:41,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:36:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:41,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:36:41,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:41,672 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-03 19:36:41,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:41,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:36:41,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:36:41,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:36:41,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:36:41,676 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 23 states. [2019-09-03 19:36:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:42,371 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-09-03 19:36:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:36:42,371 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-03 19:36:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:42,372 INFO L225 Difference]: With dead ends: 94 [2019-09-03 19:36:42,372 INFO L226 Difference]: Without dead ends: 89 [2019-09-03 19:36:42,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:36:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-03 19:36:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-09-03 19:36:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 19:36:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-03 19:36:42,377 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 48 [2019-09-03 19:36:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:42,377 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-03 19:36:42,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:36:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-03 19:36:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:36:42,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:42,378 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:42,378 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2020866407, now seen corresponding path program 19 times [2019-09-03 19:36:42,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:42,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:42,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:36:42,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:42,668 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-03 19:36:42,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:42,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:42,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:36:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:42,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:36:42,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:42,744 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-03 19:36:42,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:42,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:36:42,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:36:42,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:36:42,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:36:42,747 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 23 states. [2019-09-03 19:36:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:43,328 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-09-03 19:36:43,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:36:43,329 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-03 19:36:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:43,330 INFO L225 Difference]: With dead ends: 96 [2019-09-03 19:36:43,330 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 19:36:43,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:36:43,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 19:36:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-09-03 19:36:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:36:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-03 19:36:43,335 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 48 [2019-09-03 19:36:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:43,336 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-03 19:36:43,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:36:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-03 19:36:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:36:43,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:43,337 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:43,337 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash 157176188, now seen corresponding path program 20 times [2019-09-03 19:36:43,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:43,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:43,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:43,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:36:43,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:43,643 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-03 19:36:43,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:43,643 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-03 19:36:43,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:36:43,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:36:43,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:43,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:36:43,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:43,726 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-03 19:36:43,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:43,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:36:43,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:36:43,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:36:43,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:36:43,729 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 24 states. [2019-09-03 19:36:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:44,482 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2019-09-03 19:36:44,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:36:44,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-03 19:36:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:44,483 INFO L225 Difference]: With dead ends: 98 [2019-09-03 19:36:44,483 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 19:36:44,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:36:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 19:36:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-03 19:36:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 19:36:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-03 19:36:44,487 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 50 [2019-09-03 19:36:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:44,487 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-03 19:36:44,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:36:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-03 19:36:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:36:44,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:44,488 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:44,488 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash 405190996, now seen corresponding path program 20 times [2019-09-03 19:36:44,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:44,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:44,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:44,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:44,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:44,797 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-03 19:36:44,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:44,797 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-03 19:36:44,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:36:44,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:36:44,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:44,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:36:44,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:44,862 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-03 19:36:44,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:44,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:36:44,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:36:44,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:36:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:36:44,866 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 24 states. [2019-09-03 19:36:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:45,508 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-09-03 19:36:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:36:45,514 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-03 19:36:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:45,515 INFO L225 Difference]: With dead ends: 100 [2019-09-03 19:36:45,515 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 19:36:45,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:36:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 19:36:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-03 19:36:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-03 19:36:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-09-03 19:36:45,520 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 50 [2019-09-03 19:36:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:45,520 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-09-03 19:36:45,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:36:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-09-03 19:36:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:36:45,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:45,521 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:45,521 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:45,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:45,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1797793337, now seen corresponding path program 21 times [2019-09-03 19:36:45,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:45,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:45,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:45,951 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-03 19:36:45,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:45,951 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) [2019-09-03 19:36:45,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:49,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 19:36:49,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:49,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:36:49,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:49,385 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-03 19:36:49,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:49,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 19:36:49,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:36:49,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:36:49,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:36:49,391 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2019-09-03 19:36:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:50,195 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-09-03 19:36:50,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:36:50,196 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-03 19:36:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:50,197 INFO L225 Difference]: With dead ends: 102 [2019-09-03 19:36:50,197 INFO L226 Difference]: Without dead ends: 97 [2019-09-03 19:36:50,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:36:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-03 19:36:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-09-03 19:36:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 19:36:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-03 19:36:50,203 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 52 [2019-09-03 19:36:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:50,203 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-03 19:36:50,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:36:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-03 19:36:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:36:50,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:50,204 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:50,204 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:50,204 INFO L82 PathProgramCache]: Analyzing trace with hash -320886449, now seen corresponding path program 21 times [2019-09-03 19:36:50,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:50,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:50,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:50,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:50,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:50,572 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-03 19:36:50,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:50,573 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) [2019-09-03 19:36:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:08,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 19:37:08,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:08,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:37:08,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:08,360 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-03 19:37:08,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:08,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 19:37:08,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:37:08,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:37:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:37:08,367 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 25 states. [2019-09-03 19:37:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:09,042 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2019-09-03 19:37:09,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:37:09,043 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-03 19:37:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:09,044 INFO L225 Difference]: With dead ends: 104 [2019-09-03 19:37:09,044 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 19:37:09,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:37:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 19:37:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-09-03 19:37:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-03 19:37:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-03 19:37:09,050 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 52 [2019-09-03 19:37:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:09,050 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-03 19:37:09,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:37:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-03 19:37:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:37:09,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:09,051 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:09,052 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 22 times [2019-09-03 19:37:09,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:09,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:09,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:09,460 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-03 19:37:09,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:09,461 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-03 19:37:09,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:37:09,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:37:09,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:09,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:37:09,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:09,549 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 (46)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:37:09,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:09,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:37:09,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:37:09,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:37:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:37:09,553 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 26 states. [2019-09-03 19:37:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:10,447 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-09-03 19:37:10,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:37:10,448 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-03 19:37:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:10,449 INFO L225 Difference]: With dead ends: 106 [2019-09-03 19:37:10,449 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 19:37:10,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:37:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 19:37:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-03 19:37:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:37:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-09-03 19:37:10,455 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 54 [2019-09-03 19:37:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:10,455 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-09-03 19:37:10,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:37:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-09-03 19:37:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:37:10,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:10,456 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:10,456 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:10,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1998358154, now seen corresponding path program 22 times [2019-09-03 19:37:10,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:10,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:10,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:10,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:10,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:10,817 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-03 19:37:10,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:10,818 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-03 19:37:10,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:37:10,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:37:10,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:10,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:37:10,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:10,877 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-03 19:37:10,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:10,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:37:10,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:37:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:37:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:37:10,880 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 26 states. [2019-09-03 19:37:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:11,639 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-09-03 19:37:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:37:11,639 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-03 19:37:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:11,640 INFO L225 Difference]: With dead ends: 108 [2019-09-03 19:37:11,640 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 19:37:11,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:37:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 19:37:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-09-03 19:37:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 19:37:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-09-03 19:37:11,646 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 54 [2019-09-03 19:37:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:11,646 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-09-03 19:37:11,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:37:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-09-03 19:37:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:37:11,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:11,647 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:11,647 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:11,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1929974285, now seen corresponding path program 23 times [2019-09-03 19:37:11,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:11,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:11,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:11,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:11,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:12,035 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-03 19:37:12,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:12,035 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-03 19:37:12,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:38:13,972 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-03 19:38:13,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:14,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:38:14,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:14,039 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-03 19:38:14,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:14,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:38:14,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:38:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:38:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:38:14,047 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 27 states. [2019-09-03 19:38:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:14,931 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2019-09-03 19:38:14,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:38:14,932 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-03 19:38:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:14,933 INFO L225 Difference]: With dead ends: 110 [2019-09-03 19:38:14,933 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 19:38:14,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:38:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 19:38:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-03 19:38:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 19:38:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-03 19:38:14,939 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 56 [2019-09-03 19:38:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:14,939 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-03 19:38:14,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:38:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-03 19:38:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:38:14,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:14,940 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:14,940 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1704395013, now seen corresponding path program 23 times [2019-09-03 19:38:14,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:14,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:14,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:15,318 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-03 19:38:15,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:15,319 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-03 19:38:15,330 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:41:03,932 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-03 19:41:03,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:03,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:41:03,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:04,023 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-03 19:41:04,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:04,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:41:04,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:41:04,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:41:04,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:41:04,031 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 27 states. [2019-09-03 19:41:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:04,844 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-09-03 19:41:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:41:04,845 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-03 19:41:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:04,846 INFO L225 Difference]: With dead ends: 112 [2019-09-03 19:41:04,846 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 19:41:04,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:41:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 19:41:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-03 19:41:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 19:41:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-09-03 19:41:04,852 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 56 [2019-09-03 19:41:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:04,852 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-09-03 19:41:04,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:41:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-09-03 19:41:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 19:41:04,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:04,853 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:04,853 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1795916016, now seen corresponding path program 24 times [2019-09-03 19:41:04,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:04,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:04,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:04,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:04,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:05,329 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-03 19:41:05,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:05,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:41:05,340 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:41:21,177 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:41:21,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:21,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:41:21,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:21,240 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-03 19:41:21,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:21,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:41:21,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:41:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:41:21,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:41:21,246 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 28 states. [2019-09-03 19:41:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:22,320 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-09-03 19:41:22,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:41:22,321 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-03 19:41:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:22,322 INFO L225 Difference]: With dead ends: 114 [2019-09-03 19:41:22,322 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 19:41:22,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:41:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 19:41:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-03 19:41:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 19:41:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-03 19:41:22,327 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 58 [2019-09-03 19:41:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:22,327 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-03 19:41:22,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:41:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-03 19:41:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 19:41:22,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:22,328 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:22,329 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:22,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:22,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1621309248, now seen corresponding path program 24 times [2019-09-03 19:41:22,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:22,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:22,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:22,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:22,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:22,790 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-03 19:41:22,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:22,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:41:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:42:21,119 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:42:21,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:42:21,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:42:21,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:21,877 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-03 19:42:21,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:21,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:42:21,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:42:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:42:21,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:42:21,886 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 28 states. [2019-09-03 19:42:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:22,766 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2019-09-03 19:42:22,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:42:22,767 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-03 19:42:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:22,768 INFO L225 Difference]: With dead ends: 116 [2019-09-03 19:42:22,768 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 19:42:22,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:42:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 19:42:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-03 19:42:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:42:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-09-03 19:42:22,773 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 58 [2019-09-03 19:42:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:22,774 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-09-03 19:42:22,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:42:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-09-03 19:42:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:42:22,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:22,775 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:22,775 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:22,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:22,775 INFO L82 PathProgramCache]: Analyzing trace with hash 373770413, now seen corresponding path program 25 times [2019-09-03 19:42:22,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:22,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:22,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:22,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:42:22,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:23,223 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-03 19:42:23,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:23,224 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-03 19:42:23,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:42:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:23,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:42:23,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:23,290 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-03 19:42:23,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:23,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:42:23,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:42:23,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:42:23,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:42:23,294 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 29 states. [2019-09-03 19:42:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:24,444 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-09-03 19:42:24,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:42:24,450 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-03 19:42:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:24,451 INFO L225 Difference]: With dead ends: 118 [2019-09-03 19:42:24,451 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 19:42:24,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:42:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 19:42:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-09-03 19:42:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 19:42:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-09-03 19:42:24,455 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 60 [2019-09-03 19:42:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:24,456 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-09-03 19:42:24,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:42:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-09-03 19:42:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:42:24,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:24,457 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:24,457 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:24,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2127531451, now seen corresponding path program 25 times [2019-09-03 19:42:24,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:24,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:24,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:24,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:42:24,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:24,900 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-03 19:42:24,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:24,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:42:24,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:42:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:24,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:42:24,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:24,971 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-03 19:42:24,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:24,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:42:24,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:42:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:42:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:42:24,975 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 29 states. [2019-09-03 19:42:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:25,919 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-09-03 19:42:25,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:42:25,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-03 19:42:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:25,921 INFO L225 Difference]: With dead ends: 120 [2019-09-03 19:42:25,921 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 19:42:25,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:42:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 19:42:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-09-03 19:42:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 19:42:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-09-03 19:42:25,926 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 60 [2019-09-03 19:42:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:25,926 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-09-03 19:42:25,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:42:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-09-03 19:42:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:42:25,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:25,927 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:25,927 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:25,927 INFO L82 PathProgramCache]: Analyzing trace with hash -508553942, now seen corresponding path program 26 times [2019-09-03 19:42:25,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:25,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:25,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:25,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:42:25,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:26,465 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-03 19:42:26,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:26,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:42:26,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:42:26,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:42:26,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:42:26,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:42:26,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:26,565 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-03 19:42:26,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:26,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 19:42:26,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:42:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:42:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:42:26,570 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 30 states. [2019-09-03 19:42:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:27,781 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2019-09-03 19:42:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:42:27,781 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-03 19:42:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:27,783 INFO L225 Difference]: With dead ends: 122 [2019-09-03 19:42:27,783 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 19:42:27,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:42:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 19:42:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-09-03 19:42:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 19:42:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-09-03 19:42:27,788 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 62 [2019-09-03 19:42:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:27,788 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-09-03 19:42:27,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:42:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-09-03 19:42:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:42:27,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:27,788 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:27,789 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1285881846, now seen corresponding path program 26 times [2019-09-03 19:42:27,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:27,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:27,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:27,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:42:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:28,386 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-03 19:42:28,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:28,387 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-03 19:42:28,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:42:28,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:42:28,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:42:28,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:42:28,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (55)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:42:28,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:28,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 19:42:28,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:42:28,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:42:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:42:28,485 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 30 states. [2019-09-03 19:42:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:29,442 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-09-03 19:42:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:42:29,442 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-03 19:42:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:29,444 INFO L225 Difference]: With dead ends: 124 [2019-09-03 19:42:29,444 INFO L226 Difference]: Without dead ends: 119 [2019-09-03 19:42:29,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:42:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-03 19:42:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-03 19:42:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 19:42:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-09-03 19:42:29,449 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 62 [2019-09-03 19:42:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:29,449 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-09-03 19:42:29,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:42:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-09-03 19:42:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:42:29,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:29,450 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:29,451 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1981265511, now seen corresponding path program 27 times [2019-09-03 19:42:29,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:29,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:29,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:42:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:29,980 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-03 19:42:29,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:29,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:42:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:42:45,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 19:42:45,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:42:45,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:42:45,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:45,256 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-03 19:42:45,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:45,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-03 19:42:45,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:42:45,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:42:45,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:42:45,262 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 31 states. [2019-09-03 19:42:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:46,560 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-09-03 19:42:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:42:46,561 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-03 19:42:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:46,562 INFO L225 Difference]: With dead ends: 126 [2019-09-03 19:42:46,562 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 19:42:46,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:42:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 19:42:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-09-03 19:42:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:42:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-09-03 19:42:46,567 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 64 [2019-09-03 19:42:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:46,567 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-09-03 19:42:46,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:42:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-09-03 19:42:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:42:46,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:46,568 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:46,568 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:46,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash -85536911, now seen corresponding path program 27 times [2019-09-03 19:42:46,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:46,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:46,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:42:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:47,159 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-03 19:42:47,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:47,159 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) [2019-09-03 19:42:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:43:28,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 19:43:28,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:43:28,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:43:28,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:43:28,086 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-03 19:43:28,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:28,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-03 19:43:28,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:43:28,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:43:28,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:43:28,093 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 31 states. [2019-09-03 19:43:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:29,205 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-09-03 19:43:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:43:29,206 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-03 19:43:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:29,207 INFO L225 Difference]: With dead ends: 128 [2019-09-03 19:43:29,207 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 19:43:29,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:43:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 19:43:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-03 19:43:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 19:43:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-09-03 19:43:29,213 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 64 [2019-09-03 19:43:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:29,213 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-09-03 19:43:29,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:43:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-09-03 19:43:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 19:43:29,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:43:29,214 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:43:29,214 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:43:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:43:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1893991324, now seen corresponding path program 28 times [2019-09-03 19:43:29,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:43:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:43:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:29,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:43:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:29,720 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-03 19:43:29,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:43:29,720 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-03 19:43:29,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:43:29,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:43:29,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:43:29,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:43:29,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:43:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:43:29,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:29,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 19:43:29,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:43:29,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:43:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:43:29,836 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 32 states. [2019-09-03 19:43:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:31,233 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-09-03 19:43:31,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:43:31,233 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-03 19:43:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:31,234 INFO L225 Difference]: With dead ends: 130 [2019-09-03 19:43:31,234 INFO L226 Difference]: Without dead ends: 125 [2019-09-03 19:43:31,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:43:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-03 19:43:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-03 19:43:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 19:43:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-09-03 19:43:31,239 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 66 [2019-09-03 19:43:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:31,239 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-09-03 19:43:31,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:43:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-09-03 19:43:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 19:43:31,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:43:31,240 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:43:31,240 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:43:31,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:43:31,240 INFO L82 PathProgramCache]: Analyzing trace with hash 535997484, now seen corresponding path program 28 times [2019-09-03 19:43:31,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:43:31,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:43:31,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:31,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:43:31,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:31,758 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-03 19:43:31,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:43:31,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:43:31,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:43:31,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:43:31,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:43:31,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:43:31,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:43:31,837 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-03 19:43:31,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:31,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 19:43:31,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:43:31,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:43:31,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:43:31,841 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 32 states. [2019-09-03 19:43:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:33,005 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-09-03 19:43:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:43:33,005 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-03 19:43:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:33,007 INFO L225 Difference]: With dead ends: 132 [2019-09-03 19:43:33,007 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 19:43:33,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:43:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 19:43:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-03 19:43:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 19:43:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-09-03 19:43:33,011 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 66 [2019-09-03 19:43:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:33,012 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-09-03 19:43:33,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:43:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-09-03 19:43:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:43:33,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:43:33,013 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:43:33,013 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:43:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:43:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2015803169, now seen corresponding path program 29 times [2019-09-03 19:43:33,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:43:33,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:43:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:33,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:43:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:33,667 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-03 19:43:33,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:43:33,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:43:33,679 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:46:50,676 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-03 19:46:50,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:46:50,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 19:46:50,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:46:50,838 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-03 19:46:50,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:46:50,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-03 19:46:50,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:46:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:46:50,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:46:50,847 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 33 states. [2019-09-03 19:46:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:46:52,317 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2019-09-03 19:46:52,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:46:52,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2019-09-03 19:46:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:46:52,319 INFO L225 Difference]: With dead ends: 134 [2019-09-03 19:46:52,320 INFO L226 Difference]: Without dead ends: 129 [2019-09-03 19:46:52,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:46:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-03 19:46:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-09-03 19:46:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 19:46:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-09-03 19:46:52,325 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 68 [2019-09-03 19:46:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:46:52,325 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-09-03 19:46:52,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:46:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-09-03 19:46:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:46:52,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:46:52,326 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:46:52,326 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:46:52,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:46:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash 830096935, now seen corresponding path program 29 times [2019-09-03 19:46:52,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:46:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:46:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:52,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:46:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:46:52,884 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-03 19:46:52,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:46:52,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:46:52,893 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1