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/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:38:49,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:38:49,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:38:49,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:38:49,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:38:49,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:38:49,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:38:49,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:38:49,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:38:49,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:38:49,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:38:49,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:38:49,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:38:49,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:38:49,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:38:49,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:38:49,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:38:49,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:38:49,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:38:49,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:38:49,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:38:49,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:38:50,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:38:50,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:38:50,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:38:50,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:38:50,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:38:50,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:38:50,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:38:50,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:38:50,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:38:50,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:38:50,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:38:50,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:38:50,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:38:50,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:38:50,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:38:50,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:38:50,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:38:50,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:38:50,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:38:50,021 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:38:50,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:38:50,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:38:50,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:38:50,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:38:50,036 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:38:50,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:38:50,037 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:38:50,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:38:50,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:38:50,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:38:50,038 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:38:50,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:38:50,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:38:50,038 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:38:50,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:38:50,039 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:38:50,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:38:50,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:38:50,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:38:50,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:38:50,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:38:50,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:38:50,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:38:50,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:38:50,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:38:50,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:38:50,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:38:50,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:38:50,041 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:38:50,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:38:50,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:38:50,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:38:50,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:38:50,088 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:38:50,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-03 19:38:50,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54852cc1c/27bd292086644f95a671b1c994d2e5f4/FLAG7129e228a [2019-09-03 19:38:50,554 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:38:50,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-03 19:38:50,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54852cc1c/27bd292086644f95a671b1c994d2e5f4/FLAG7129e228a [2019-09-03 19:38:50,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54852cc1c/27bd292086644f95a671b1c994d2e5f4 [2019-09-03 19:38:50,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:38:50,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:38:51,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:38:51,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:38:51,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:38:51,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:38:50" (1/1) ... [2019-09-03 19:38:51,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d452d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51, skipping insertion in model container [2019-09-03 19:38:51,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:38:50" (1/1) ... [2019-09-03 19:38:51,013 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:38:51,024 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:38:51,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:38:51,166 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:38:51,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:38:51,191 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:38:51,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51 WrapperNode [2019-09-03 19:38:51,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:38:51,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:38:51,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:38:51,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:38:51,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (1/1) ... [2019-09-03 19:38:51,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (1/1) ... [2019-09-03 19:38:51,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (1/1) ... [2019-09-03 19:38:51,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (1/1) ... [2019-09-03 19:38:51,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (1/1) ... [2019-09-03 19:38:51,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (1/1) ... [2019-09-03 19:38:51,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (1/1) ... [2019-09-03 19:38:51,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:38:51,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:38:51,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:38:51,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:38:51,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (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:38:51,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:38:51,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:38:51,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:38:51,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:38:51,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:38:51,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:38:51,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:38:51,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:38:51,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:38:51,520 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:38:51,520 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:38:51,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:38:51 BoogieIcfgContainer [2019-09-03 19:38:51,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:38:51,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:38:51,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:38:51,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:38:51,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:38:50" (1/3) ... [2019-09-03 19:38:51,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d62b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:38:51, skipping insertion in model container [2019-09-03 19:38:51,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:51" (2/3) ... [2019-09-03 19:38:51,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d62b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:38:51, skipping insertion in model container [2019-09-03 19:38:51,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:38:51" (3/3) ... [2019-09-03 19:38:51,529 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2019-09-03 19:38:51,539 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:38:51,547 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:38:51,562 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:38:51,591 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:38:51,592 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:38:51,592 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:38:51,592 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:38:51,593 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:38:51,593 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:38:51,593 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:38:51,593 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:38:51,593 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:38:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-03 19:38:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:38:51,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:51,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:51,619 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-03 19:38:51,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:51,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:51,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:51,822 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:38:51,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:38:51,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:38:51,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:38:51,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:38:51,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:38:51,845 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-03 19:38:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:51,877 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-03 19:38:51,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:38:51,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:38:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:51,887 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:38:51,887 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:38:51,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:38:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:38:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:38:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:38:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 19:38:51,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 19:38:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:51,930 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 19:38:51,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:38:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 19:38:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 19:38:51,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:51,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:51,931 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-03 19:38:51,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:51,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:51,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:51,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:52,088 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:38:52,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:52,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:52,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:52,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:38:52,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:52,224 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:38:52,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:52,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:38:52,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:38:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:38:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:38:52,231 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-03 19:38:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:52,250 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 19:38:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:38:52,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-03 19:38:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:52,251 INFO L225 Difference]: With dead ends: 18 [2019-09-03 19:38:52,252 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 19:38:52,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:38:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 19:38:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 19:38:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 19:38:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 19:38:52,258 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-03 19:38:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:52,258 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 19:38:52,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:38:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 19:38:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:38:52,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:52,260 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:52,260 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:52,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-03 19:38:52,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:52,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:52,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:52,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:52,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:52,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:52,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:38:52,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:38:52,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:52,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:38:52,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:52,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:52,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:38:52,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:38:52,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:38:52,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:38:52,464 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-03 19:38:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:52,500 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 19:38:52,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:38:52,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 19:38:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:52,502 INFO L225 Difference]: With dead ends: 19 [2019-09-03 19:38:52,502 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:38:52,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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:38:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:38:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 19:38:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:38:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 19:38:52,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-03 19:38:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:52,511 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 19:38:52,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:38:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 19:38:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:38:52,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:52,512 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:52,512 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-03 19:38:52,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:52,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:52,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:52,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:52,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:52,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:38:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:52,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:38:52,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:52,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:38:52,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:52,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:52,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:38:52,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:38:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:38:52,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:38:52,726 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-03 19:38:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:52,767 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 19:38:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:38:52,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 19:38:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:52,769 INFO L225 Difference]: With dead ends: 20 [2019-09-03 19:38:52,769 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 19:38:52,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 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:38:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 19:38:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 19:38:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:38:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 19:38:52,774 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-03 19:38:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:52,774 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 19:38:52,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:38:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 19:38:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:38:52,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:52,776 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:52,776 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-03 19:38:52,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:52,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:52,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:52,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:52,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:52,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:52,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:38:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:52,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:38:52,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:52,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:38:52,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:52,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:52,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:38:52,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:38:52,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:38:52,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:38:52,972 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-03 19:38:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:53,027 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 19:38:53,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:38:53,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-03 19:38:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:53,029 INFO L225 Difference]: With dead ends: 21 [2019-09-03 19:38:53,029 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:38:53,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:38:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:38:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 19:38:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 19:38:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 19:38:53,034 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-03 19:38:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:53,034 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 19:38:53,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:38:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 19:38:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:38:53,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:53,035 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:53,035 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:53,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-03 19:38:53,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:53,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:53,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:53,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:38:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:53,179 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:38:53,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:53,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:38:53,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:53,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:53,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:53,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:38:53,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:38:53,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:38:53,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:38:53,216 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-03 19:38:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:53,271 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 19:38:53,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:38:53,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-03 19:38:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:53,272 INFO L225 Difference]: With dead ends: 22 [2019-09-03 19:38:53,272 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:38:53,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 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:38:53,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:38:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:38:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:38:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 19:38:53,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-03 19:38:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:53,277 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 19:38:53,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:38:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 19:38:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:38:53,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:53,278 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:53,279 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:53,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-03 19:38:53,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:53,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:53,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:53,395 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:38:53,410 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:53,425 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:38:53,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:53,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:38:53,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:53,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:53,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:38:53,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:38:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:38:53,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:38:53,457 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-03 19:38:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:53,529 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 19:38:53,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:38:53,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 19:38:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:53,531 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:38:53,531 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:38:53,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 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:38:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:38:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 19:38:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 19:38:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-03 19:38:53,538 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-03 19:38:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:53,539 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-03 19:38:53,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:38:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-03 19:38:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:38:53,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:53,540 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:53,541 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:53,541 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-03 19:38:53,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:53,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:53,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:53,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:53,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:53,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:53,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:53,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:38:53,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:53,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:53,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:38:53,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:38:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:38:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:38:53,750 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-03 19:38:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:53,808 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 19:38:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:38:53,808 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-03 19:38:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:53,809 INFO L225 Difference]: With dead ends: 24 [2019-09-03 19:38:53,809 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:38:53,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 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:38:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:38:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 19:38:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:38:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:38:53,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-03 19:38:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:53,814 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:38:53,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:38:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:38:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:38:53,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:53,815 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:53,815 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-03 19:38:53,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:53,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:53,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:53,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:53,972 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:38:53,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:53,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:38:53,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:54,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:38:54,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:54,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:38:54,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:54,072 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:38:54,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:54,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:38:54,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:38:54,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:38:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:38:54,079 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-03 19:38:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:54,189 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 19:38:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:38:54,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-03 19:38:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:54,193 INFO L225 Difference]: With dead ends: 25 [2019-09-03 19:38:54,193 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:38:54,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 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:38:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:38:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 19:38:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 19:38:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-03 19:38:54,200 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-03 19:38:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:54,201 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-03 19:38:54,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:38:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-03 19:38:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:38:54,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:54,202 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:54,203 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-03 19:38:54,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:54,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:54,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:54,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:54,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:54,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:54,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:38:54,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:38:54,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:54,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:38:54,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:54,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:54,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:38:54,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:38:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:38:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:38:54,468 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-03 19:38:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:54,553 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 19:38:54,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:38:54,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-03 19:38:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:54,554 INFO L225 Difference]: With dead ends: 26 [2019-09-03 19:38:54,554 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 19:38:54,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 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:38:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 19:38:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 19:38:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:38:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 19:38:54,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-03 19:38:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:54,559 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 19:38:54,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:38:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 19:38:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:38:54,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:54,560 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:54,561 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-03 19:38:54,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:54,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:54,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:54,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:54,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:38:54,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:38:54,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:54,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:38:54,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:54,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:54,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:38:54,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:38:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:38:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:38:54,789 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-03 19:38:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:54,884 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 19:38:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:38:54,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-03 19:38:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:54,887 INFO L225 Difference]: With dead ends: 27 [2019-09-03 19:38:54,887 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:38:54,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 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:38:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:38:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:38:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:38:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-03 19:38:54,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-03 19:38:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:54,892 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-03 19:38:54,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:38:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-03 19:38:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:38:54,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:54,893 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:54,893 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-03 19:38:54,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:54,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:54,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:54,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:55,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:55,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:55,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:39:11,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:39:11,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:12,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:39:12,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:12,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:12,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:39:12,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:39:12,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:39:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:39:12,177 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-03 19:39:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:12,298 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 19:39:12,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:39:12,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-03 19:39:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:12,301 INFO L225 Difference]: With dead ends: 28 [2019-09-03 19:39:12,301 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:39:12,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 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:39:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:39:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 19:39:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:39:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 19:39:12,306 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-03 19:39:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:12,307 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 19:39:12,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:39:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 19:39:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:39:12,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:12,308 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:12,309 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:12,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-03 19:39:12,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:12,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:12,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:12,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:12,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:12,651 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:39:24,934 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:39:24,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:24,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:39:24,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:24,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:39:24,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:39:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:39:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:39:24,979 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-03 19:39:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:25,099 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 19:39:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:39:25,103 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-03 19:39:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:25,103 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:39:25,103 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:39:25,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:39:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:39:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 19:39:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:39:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-03 19:39:25,108 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-03 19:39:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:25,108 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-03 19:39:25,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:39:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-03 19:39:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:39:25,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:25,109 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:25,110 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:25,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-03 19:39:25,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:25,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:25,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:25,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:25,334 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:39:25,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:39:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:25,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:39:25,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:25,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:25,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:39:25,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:39:25,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:39:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:39:25,413 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-03 19:39:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:25,548 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 19:39:25,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:39:25,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-03 19:39:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:25,549 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:39:25,549 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:39:25,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 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:39:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:39:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 19:39:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:39:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 19:39:25,554 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-03 19:39:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:25,554 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 19:39:25,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:39:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 19:39:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:39:25,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:25,555 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:25,556 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-03 19:39:25,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:25,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:25,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:25,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:39:25,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:25,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:25,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:25,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:39:25,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:39:25,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:25,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:39:25,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:25,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:25,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:39:25,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:39:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:39:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:39:25,879 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-03 19:39:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:26,066 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 19:39:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:39:26,067 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-03 19:39:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:26,068 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:39:26,068 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:39:26,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 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:39:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:39:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 19:39:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:39:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-03 19:39:26,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-03 19:39:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:26,074 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-03 19:39:26,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:39:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-03 19:39:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:39:26,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:26,076 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:26,076 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-03 19:39:26,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:26,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:26,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:26,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:26,325 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:39:26,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:39:27,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:39:27,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:27,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:39:27,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:27,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:27,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 19:39:27,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:39:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:39:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:39:27,960 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-03 19:39:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:28,164 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 19:39:28,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:39:28,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-03 19:39:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:28,165 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:39:28,166 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:39:28,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:39:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:39:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 19:39:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:39:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 19:39:28,171 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-03 19:39:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:28,171 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 19:39:28,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:39:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 19:39:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:39:28,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:28,173 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:28,173 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-03 19:39:28,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:28,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:28,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:28,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:39:28,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:28,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:39:28,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:28,470 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:39:28,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:28,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:28,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:39:28,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:39:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:39:28,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:39:28,515 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-03 19:39:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:28,785 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 19:39:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:39:28,786 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-03 19:39:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:28,786 INFO L225 Difference]: With dead ends: 33 [2019-09-03 19:39:28,786 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:39:28,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 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:39:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:39:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 19:39:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 19:39:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-03 19:39:28,791 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-03 19:39:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:28,792 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-03 19:39:28,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:39:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-03 19:39:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:39:28,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:28,793 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:28,793 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-03 19:39:28,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:28,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:28,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:28,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:28,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:29,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:29,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:29,095 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:40:24,061 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:40:24,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:24,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:40:24,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:24,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:24,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:40:24,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:40:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:40:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:40:24,355 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-03 19:40:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:24,616 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 19:40:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:40:24,617 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-03 19:40:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:24,617 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:40:24,617 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:40:24,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:40:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:40:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 19:40:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:40:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 19:40:24,622 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-03 19:40:24,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:24,622 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 19:40:24,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:40:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 19:40:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:40:24,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:24,623 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:24,623 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:24,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-03 19:40:24,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:24,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:24,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:24,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:24,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:24,910 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:40:40,128 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:40:40,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:40,161 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:40:40,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:40,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:40,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:40:40,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:40:40,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:40:40,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:40:40,204 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-03 19:40:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:40,481 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 19:40:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:40:40,482 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-03 19:40:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:40,483 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:40:40,483 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:40:40,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 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:40:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:40:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 19:40:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:40:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-03 19:40:40,491 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-03 19:40:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:40,491 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-03 19:40:40,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:40:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-03 19:40:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:40:40,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:40,492 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:40,492 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-03 19:40:40,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:40,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:40,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:40,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:40,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:40,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:40,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:40:40,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:40,900 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:40:40,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:40,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:40,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:40:40,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:40:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:40:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:40:40,938 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-03 19:40:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:41,254 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 19:40:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:40:41,255 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-03 19:40:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:41,255 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:40:41,256 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:40:41,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 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:40:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:40:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 19:40:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:40:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 19:40:41,260 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-03 19:40:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:41,260 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 19:40:41,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:40:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 19:40:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:40:41,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:41,261 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:41,261 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-03 19:40:41,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:41,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:41,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:40:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:41,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:41,583 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:40:41,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:40:41,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:40:41,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:41,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:40:41,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:40:41,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:41,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:40:41,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:40:41,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:40:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:40:41,686 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-03 19:40:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:41,989 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 19:40:41,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:40:41,997 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-03 19:40:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:41,998 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:40:41,998 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:40:41,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 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:40:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:40:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 19:40:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:40:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-03 19:40:42,004 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-03 19:40:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:42,005 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-03 19:40:42,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:40:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-03 19:40:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:40:42,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:42,008 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:42,008 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-03 19:40:42,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:42,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:42,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:42,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:42,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:42,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:41:00,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:41:00,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:00,045 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:41:00,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:00,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:00,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 19:41:00,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:41:00,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:41:00,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:41:00,121 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-03 19:41:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:00,455 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 19:41:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:41:00,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-03 19:41:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:00,464 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:41:00,464 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:41:00,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:41:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:41:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:41:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:41:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 19:41:00,470 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-03 19:41:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:00,471 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 19:41:00,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:41:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 19:41:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:41:00,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:00,474 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:00,474 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-03 19:41:00,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:00,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:00,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:00,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:00,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:00,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:00,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:00,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:41:00,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:41:00,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:00,883 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:41:00,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:00,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:41:00,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:41:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:41:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:41:00,932 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-03 19:41:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:01,275 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 19:41:01,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:41:01,275 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-03 19:41:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:01,276 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:41:01,276 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:41:01,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 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:41:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:41:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 19:41:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:41:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-03 19:41:01,281 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-03 19:41:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:01,281 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-03 19:41:01,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:41:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-03 19:41:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:41:01,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:01,282 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:01,282 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:01,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:01,283 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-03 19:41:01,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:01,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:01,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:01,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:01,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:01,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:01,726 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:41:01,737 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:42:41,127 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:42:41,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:42:41,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:42:41,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:42:41,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:41,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:42:41,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:42:41,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:42:41,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:42:41,380 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-03 19:42:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:41,776 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 19:42:41,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:42:41,777 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-03 19:42:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:41,778 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:42:41,778 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:42:41,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:42:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:42:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 19:42:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:42:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 19:42:41,782 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-03 19:42:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:41,782 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 19:42:41,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:42:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 19:42:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:42:41,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:41,783 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:41,784 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-03 19:42:41,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:41,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:41,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:41,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:42:41,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:42:42,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:42,211 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:42:42,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:43:50,545 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:43:50,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:43:51,315 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:43:51,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:43:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:51,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:51,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:43:51,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:43:51,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:43:51,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:43:51,358 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-03 19:43:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:51,784 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 19:43:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:43:51,785 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-03 19:43:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:51,786 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:43:51,786 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:43:51,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 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:43:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:43:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-03 19:43:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 19:43:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-03 19:43:51,790 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-03 19:43:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:51,790 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-03 19:43:51,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:43:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-03 19:43:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 19:43:51,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:43:51,791 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:43:51,791 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:43:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:43:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-03 19:43:51,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:43:51,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:43:51,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:51,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:43:51,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:52,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:43:52,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:43:52,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:43:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:52,261 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:43:52,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:43:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:52,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:52,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:43:52,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:43:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:43:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:43:52,307 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-03 19:43:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:52,792 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 19:43:52,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:43:52,793 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-03 19:43:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:52,793 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:43:52,793 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:43:52,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 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:43:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:43:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 19:43:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:43:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 19:43:52,799 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-03 19:43:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:52,799 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 19:43:52,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:43:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 19:43:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:43:52,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:43:52,800 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:43:52,800 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:43:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:43:52,801 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-03 19:43:52,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:43:52,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:43:52,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:52,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:43:52,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:53,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:43:53,432 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:43:53,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:43:53,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:43:53,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:43:53,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:43:53,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:43:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:53,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:53,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 19:43:53,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:43:53,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:43:53,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:43:53,540 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-03 19:43:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:54,058 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 19:43:54,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:43:54,059 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-03 19:43:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:54,059 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:43:54,059 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:43:54,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:43:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:43:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 19:43:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 19:43:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-03 19:43:54,063 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-03 19:43:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:54,064 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-03 19:43:54,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:43:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-03 19:43:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:43:54,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:43:54,065 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:43:54,065 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:43:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:43:54,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-03 19:43:54,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:43:54,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:43:54,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:54,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:43:54,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:54,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:43:54,582 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:43:54,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:45:09,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:45:09,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:45:09,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:45:09,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:45:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:45:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:45:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-03 19:45:09,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:45:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:45:09,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:45:09,728 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-03 19:45:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:45:10,254 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 19:45:10,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:45:10,255 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-03 19:45:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:45:10,255 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:45:10,255 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:45:10,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 3 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:45:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:45:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 19:45:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:45:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 19:45:10,259 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-03 19:45:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:45:10,260 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 19:45:10,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:45:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 19:45:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:45:10,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:45:10,261 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:45:10,261 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:45:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:45:10,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-03 19:45:10,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:45:10,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:45:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:10,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:45:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:45:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:45:10,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:45:10,830 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:45:10,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:45:10,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:45:10,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:45:10,857 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:45:10,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:45:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:45:10,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:45:10,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 19:45:10,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:45:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:45:10,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:45:10,898 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-03 19:45:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:45:11,476 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 19:45:11,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:45:11,476 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-03 19:45:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:45:11,477 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:45:11,477 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:45:11,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 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:45:11,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:45:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 19:45:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:45:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-03 19:45:11,483 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-03 19:45:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:45:11,483 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-03 19:45:11,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:45:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-03 19:45:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:45:11,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:45:11,484 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:45:11,484 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:45:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:45:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-03 19:45:11,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:45:11,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:45:11,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:11,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:45:11,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:45:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:45:12,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:45:12,114 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:45:12,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:48:13,675 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:48:13,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:48:14,404 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 19:48:14,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:48:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:48:14,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:48:14,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-03 19:48:14,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:48:14,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:48:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:48:14,450 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-03 19:48:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:15,072 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 19:48:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:48:15,073 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-03 19:48:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:15,073 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:48:15,073 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:48:15,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 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:48:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:48:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 19:48:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:48:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 19:48:15,079 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-03 19:48:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:15,080 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 19:48:15,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:48:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 19:48:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:48:15,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:15,081 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:15,081 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:15,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-03 19:48:15,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:15,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:15,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:15,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:48:15,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:48:15,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:15,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:48:15,931 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:49:28,210 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:49:28,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:28,902 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:49:28,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:28,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:28,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-03 19:49:28,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:49:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:49:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:49:28,985 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-03 19:49:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:29,643 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 19:49:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:49:29,643 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-03 19:49:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:29,644 INFO L225 Difference]: With dead ends: 47 [2019-09-03 19:49:29,644 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:49:29,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:49:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:49:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 19:49:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:49:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-03 19:49:29,649 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-03 19:49:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:29,650 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-03 19:49:29,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:49:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-03 19:49:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:49:29,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:29,651 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:29,651 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-03 19:49:29,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:29,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:29,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:29,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:30,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:30,355 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:49:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:30,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 19:49:30,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:49:30,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:30,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-03 19:49:30,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:49:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:49:30,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:49:30,481 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-03 19:49:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:31,154 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 19:49:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:49:31,159 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-03 19:49:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:31,160 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:49:31,160 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:49:31,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:49:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:49:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 19:49:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:49:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 19:49:31,164 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-03 19:49:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:31,165 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 19:49:31,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:49:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 19:49:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:49:31,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:31,166 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:31,166 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-03 19:49:31,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:31,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:31,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:31,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:31,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:31,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:31,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:31,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:49:31,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:49:31,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:31,845 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 19:49:31,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:31,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:31,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-03 19:49:31,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:49:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:49:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:49:31,901 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-03 19:49:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:32,649 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 19:49:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:49:32,649 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-03 19:49:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:32,650 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:49:32,650 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:49:32,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:49:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:49:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 19:49:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:49:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 19:49:32,655 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-03 19:49:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:32,655 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 19:49:32,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:49:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 19:49:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:49:32,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:32,656 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:32,657 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-03 19:49:32,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:32,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:32,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:33,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:33,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:33,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:05,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 19:50:05,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:05,340 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 19:50:05,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:05,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:05,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-03 19:50:05,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:50:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:50:05,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:50:05,409 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-03 19:50:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:06,174 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 19:50:06,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:50:06,175 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-03 19:50:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:06,175 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:50:06,176 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:50:06,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:50:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:50:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 19:50:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:50:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 19:50:06,179 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-03 19:50:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:06,179 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 19:50:06,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:50:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 19:50:06,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:50:06,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:06,180 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:06,180 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:06,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:06,181 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-03 19:50:06,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:06,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:06,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:06,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:06,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:06,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:06,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:50:06,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:06,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:06,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:50:06,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:06,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:06,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-03 19:50:06,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:50:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:50:06,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:50:06,973 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-03 19:50:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:07,789 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-03 19:50:07,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:50:07,790 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-03 19:50:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:07,791 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:50:07,791 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:50:07,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:50:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:50:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 19:50:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:50:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-03 19:50:07,795 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-03 19:50:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:07,796 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-03 19:50:07,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:50:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-03 19:50:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:50:07,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:07,796 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:07,797 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-03 19:50:07,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:07,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:07,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:08,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:08,701 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:50:08,712 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:06,342 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 19:53:06,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:13,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 19:53:13,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:13,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:13,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-03 19:53:13,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:53:13,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:53:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:53:13,572 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-03 19:53:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:14,449 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-03 19:53:14,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:53:14,449 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-03 19:53:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:14,450 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:53:14,450 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:53:14,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:53:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:53:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 19:53:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:53:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 19:53:14,455 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-03 19:53:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:14,455 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 19:53:14,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:53:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 19:53:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:53:14,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:14,461 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:14,461 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:14,461 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 36 times [2019-09-03 19:53:14,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:14,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:14,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:14,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:14,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:15,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:15,223 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:53:15,233 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE