java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:43:08,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:43:08,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:43:08,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:43:08,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:43:08,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:43:08,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:43:08,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:43:08,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:43:08,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:43:08,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:43:08,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:43:08,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:43:08,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:43:08,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:43:08,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:43:08,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:43:08,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:43:08,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:43:08,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:43:08,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:43:08,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:43:08,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:43:08,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:43:08,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:43:08,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:43:08,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:43:08,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:43:08,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:43:08,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:43:08,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:43:08,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:43:08,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:43:08,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:43:08,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:43:08,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:43:08,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:43:08,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:43:08,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:43:08,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:43:08,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:43:08,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:43:08,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:43:08,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:43:08,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:43:08,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:43:08,911 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:43:08,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:43:08,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:43:08,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:43:08,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:43:08,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:43:08,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:43:08,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:43:08,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:43:08,915 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:43:08,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:43:08,915 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:43:08,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:43:08,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:43:08,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:43:08,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:43:08,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:43:08,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:43:08,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:43:08,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:43:08,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:43:08,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:43:08,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:43:08,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:43:08,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:43:08,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:43:08,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:43:08,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:43:08,966 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:43:08,967 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:43:08,967 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2019-09-05 11:43:09,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f719e58b7/2ff118ac2de94eb380e9d9614a094911/FLAG5dda6b86e [2019-09-05 11:43:09,475 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:43:09,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2019-09-05 11:43:09,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f719e58b7/2ff118ac2de94eb380e9d9614a094911/FLAG5dda6b86e [2019-09-05 11:43:09,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f719e58b7/2ff118ac2de94eb380e9d9614a094911 [2019-09-05 11:43:09,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:43:09,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:43:09,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:43:09,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:43:09,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:43:09,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:43:09" (1/1) ... [2019-09-05 11:43:09,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f83d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:09, skipping insertion in model container [2019-09-05 11:43:09,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:43:09" (1/1) ... [2019-09-05 11:43:09,909 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:43:09,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:43:10,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:43:10,104 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:43:10,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:43:10,151 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:43:10,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10 WrapperNode [2019-09-05 11:43:10,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:43:10,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:43:10,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:43:10,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:43:10,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (1/1) ... [2019-09-05 11:43:10,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (1/1) ... [2019-09-05 11:43:10,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (1/1) ... [2019-09-05 11:43:10,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (1/1) ... [2019-09-05 11:43:10,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (1/1) ... [2019-09-05 11:43:10,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (1/1) ... [2019-09-05 11:43:10,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (1/1) ... [2019-09-05 11:43:10,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:43:10,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:43:10,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:43:10,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:43:10,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:43:10,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:43:10,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:43:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:43:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:43:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:43:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:43:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:43:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:43:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:43:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:43:10,515 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:43:10,515 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:43:10,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:43:10 BoogieIcfgContainer [2019-09-05 11:43:10,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:43:10,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:43:10,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:43:10,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:43:10,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:43:09" (1/3) ... [2019-09-05 11:43:10,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4575cda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:43:10, skipping insertion in model container [2019-09-05 11:43:10,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:10" (2/3) ... [2019-09-05 11:43:10,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4575cda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:43:10, skipping insertion in model container [2019-09-05 11:43:10,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:43:10" (3/3) ... [2019-09-05 11:43:10,525 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2019-09-05 11:43:10,534 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:43:10,541 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:43:10,556 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:43:10,585 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:43:10,586 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:43:10,586 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:43:10,586 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:43:10,586 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:43:10,586 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:43:10,586 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:43:10,587 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:43:10,587 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:43:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-05 11:43:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:43:10,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:10,612 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:10,614 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-05 11:43:10,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:10,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:10,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:10,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:43:10,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:43:10,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:43:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:43:10,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:43:10,748 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-05 11:43:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:10,779 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-05 11:43:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:43:10,781 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 11:43:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:10,792 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:43:10,792 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 11:43:10,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:43:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 11:43:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 11:43:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 11:43:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-05 11:43:10,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-05 11:43:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:10,849 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-05 11:43:10,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:43:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-05 11:43:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:43:10,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:10,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:10,855 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-05 11:43:10,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:10,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:10,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:10,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:43:10,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:43:10,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:43:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:43:10,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:43:10,983 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-05 11:43:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:11,053 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-09-05 11:43:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:43:11,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 11:43:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:11,056 INFO L225 Difference]: With dead ends: 19 [2019-09-05 11:43:11,057 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 11:43:11,058 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-05 11:43:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 11:43:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-05 11:43:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 11:43:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-05 11:43:11,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-05 11:43:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:11,067 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-05 11:43:11,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:43:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-05 11:43:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:43:11,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:11,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:11,068 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-05 11:43:11,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:11,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:11,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:11,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:11,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:11,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:11,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:11,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:43:11,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-05 11:43:11,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:11,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:43:11,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:43:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:43:11,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:43:11,337 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-09-05 11:43:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:11,412 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-09-05 11:43:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:43:11,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 11:43:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:11,414 INFO L225 Difference]: With dead ends: 23 [2019-09-05 11:43:11,414 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:43:11,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:43:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:43:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-09-05 11:43:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 11:43:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-05 11:43:11,421 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-05 11:43:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:11,421 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-05 11:43:11,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:43:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-05 11:43:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:43:11,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:11,423 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:11,423 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-05 11:43:11,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:11,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:11,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:11,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:11,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:11,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:43:11,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:11,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:11,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:43:11,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:43:11,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:43:11,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:11,679 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2019-09-05 11:43:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:11,771 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-09-05 11:43:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:43:11,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 11:43:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:11,773 INFO L225 Difference]: With dead ends: 26 [2019-09-05 11:43:11,773 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 11:43:11,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 11:43:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-09-05 11:43:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:43:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-09-05 11:43:11,786 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-09-05 11:43:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:11,786 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-09-05 11:43:11,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:43:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-09-05 11:43:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:43:11,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:11,788 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:11,789 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:11,790 INFO L82 PathProgramCache]: Analyzing trace with hash -976494032, now seen corresponding path program 1 times [2019-09-05 11:43:11,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:11,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:11,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:11,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:11,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:11,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:11,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:11,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-05 11:43:11,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:11,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:43:11,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-05 11:43:11,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:43:11,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:43:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:11,994 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2019-09-05 11:43:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:12,107 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2019-09-05 11:43:12,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:43:12,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 11:43:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:12,109 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:43:12,109 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:43:12,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:43:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-09-05 11:43:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:43:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-05 11:43:12,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-09-05 11:43:12,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:12,118 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-05 11:43:12,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:43:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-05 11:43:12,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:43:12,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:12,119 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:12,119 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2019-09-05 11:43:12,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:12,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:12,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:12,228 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:12,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:43:12,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:43:12,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:12,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:43:12,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:12,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:12,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:43:12,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:43:12,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:43:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:12,301 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 7 states. [2019-09-05 11:43:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:12,394 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-09-05 11:43:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:43:12,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-05 11:43:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:12,397 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:43:12,397 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 11:43:12,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 11:43:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-09-05 11:43:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:43:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-09-05 11:43:12,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2019-09-05 11:43:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:12,413 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-09-05 11:43:12,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:43:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-09-05 11:43:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:43:12,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:12,417 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:12,417 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:12,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1391623509, now seen corresponding path program 2 times [2019-09-05 11:43:12,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:12,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:12,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:12,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:12,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:12,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:12,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:12,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-05 11:43:12,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:43:12,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:43:12,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-05 11:43:12,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:43:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:43:12,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:12,596 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 7 states. [2019-09-05 11:43:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:12,667 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-09-05 11:43:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:43:12,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-05 11:43:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:12,669 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:43:12,669 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:43:12,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:43:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:43:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-05 11:43:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:43:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-05 11:43:12,676 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-05 11:43:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:12,676 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-05 11:43:12,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:43:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-05 11:43:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:43:12,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:12,677 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:12,678 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 1 times [2019-09-05 11:43:12,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:12,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:12,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:12,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:12,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:43:12,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:43:12,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:12,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:43:12,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:43:12,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:43:12,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:12,850 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-05 11:43:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:12,929 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-05 11:43:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:43:12,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-05 11:43:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:12,931 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:43:12,931 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:43:12,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:43:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-05 11:43:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:43:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-05 11:43:12,941 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-09-05 11:43:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:12,941 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-05 11:43:12,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:43:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-05 11:43:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:43:12,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:12,944 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:12,944 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:12,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 4 times [2019-09-05 11:43:12,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:12,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:12,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:12,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:13,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:13,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:13,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:43:13,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:13,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:13,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:43:13,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:13,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:13,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:43:13,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:43:13,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:43:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:13,159 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-09-05 11:43:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:13,241 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-05 11:43:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:43:13,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 11:43:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:13,244 INFO L225 Difference]: With dead ends: 34 [2019-09-05 11:43:13,244 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:43:13,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:43:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-05 11:43:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 11:43:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-05 11:43:13,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2019-09-05 11:43:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:13,256 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-05 11:43:13,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:43:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-05 11:43:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:43:13,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:13,257 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:13,257 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:13,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash -224607324, now seen corresponding path program 2 times [2019-09-05 11:43:13,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:13,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:13,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:13,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:13,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:13,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:13,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:13,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:13,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:43:13,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:13,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:13,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:43:13,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:43:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:43:13,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:13,456 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2019-09-05 11:43:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:13,572 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-05 11:43:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:43:13,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 11:43:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:13,574 INFO L225 Difference]: With dead ends: 36 [2019-09-05 11:43:13,574 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:43:13,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:43:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 11:43:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:43:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-05 11:43:13,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-09-05 11:43:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:13,584 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-05 11:43:13,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:43:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-05 11:43:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:43:13,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:13,586 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:13,586 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:13,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1931383913, now seen corresponding path program 5 times [2019-09-05 11:43:13,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:13,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:13,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:13,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:13,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:13,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:13,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 11:43:13,739 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:43:13,804 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 11:43:13,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:13,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:43:13,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:13,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:13,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:43:13,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:43:13,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:43:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:43:13,840 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-09-05 11:43:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:13,929 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-05 11:43:13,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:43:13,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-05 11:43:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:13,932 INFO L225 Difference]: With dead ends: 38 [2019-09-05 11:43:13,932 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:43:13,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:43:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:43:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-05 11:43:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:43:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-05 11:43:13,938 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-09-05 11:43:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:13,939 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-05 11:43:13,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:43:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-05 11:43:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:43:13,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:13,940 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:13,940 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash 33316767, now seen corresponding path program 3 times [2019-09-05 11:43:13,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:13,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:13,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:13,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:14,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:14,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:14,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:14,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:43:14,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:14,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:43:14,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:14,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:43:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 11:43:14,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:43:14,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-09-05 11:43:14,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:43:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:43:14,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:43:14,507 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 13 states. [2019-09-05 11:43:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:14,847 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-09-05 11:43:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:43:14,847 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-09-05 11:43:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:14,848 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:43:14,848 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:43:14,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:43:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:43:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 11:43:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 11:43:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-05 11:43:14,860 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-05 11:43:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:14,860 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-05 11:43:14,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:43:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-05 11:43:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:43:14,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:14,864 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:14,864 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1709400550, now seen corresponding path program 6 times [2019-09-05 11:43:14,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:14,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:14,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:14,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:14,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:15,017 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:43:15,039 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:43:15,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:15,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:43:15,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:15,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:15,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:43:15,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:43:15,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:43:15,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:43:15,072 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2019-09-05 11:43:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:15,174 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-05 11:43:15,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:43:15,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-05 11:43:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:15,176 INFO L225 Difference]: With dead ends: 31 [2019-09-05 11:43:15,176 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 11:43:15,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:43:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 11:43:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-05 11:43:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:43:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-05 11:43:15,181 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-05 11:43:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:15,181 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-05 11:43:15,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:43:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-05 11:43:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:43:15,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:15,182 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:15,182 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1163213789, now seen corresponding path program 7 times [2019-09-05 11:43:15,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:15,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:15,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:15,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:15,293 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-05 11:43:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:15,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:43:15,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:15,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:15,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:43:15,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:43:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:43:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:43:15,368 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 11 states. [2019-09-05 11:43:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:15,490 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-05 11:43:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:43:15,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-05 11:43:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:15,492 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:43:15,492 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 11:43:15,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:43:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 11:43:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-05 11:43:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:43:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-05 11:43:15,497 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-05 11:43:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:15,498 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-05 11:43:15,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:43:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-05 11:43:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:43:15,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:15,499 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:15,499 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash -81622240, now seen corresponding path program 8 times [2019-09-05 11:43:15,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:15,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:15,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:15,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:15,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:15,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:15,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:15,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:15,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:43:15,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:15,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:15,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-05 11:43:15,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:43:15,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:43:15,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:43:15,706 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2019-09-05 11:43:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:15,834 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-05 11:43:15,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:43:15,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 11:43:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:15,835 INFO L225 Difference]: With dead ends: 35 [2019-09-05 11:43:15,835 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 11:43:15,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:43:15,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 11:43:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-05 11:43:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:43:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-05 11:43:15,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-05 11:43:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:15,843 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-05 11:43:15,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:43:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-05 11:43:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:43:15,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:15,847 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:15,847 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash -54229283, now seen corresponding path program 9 times [2019-09-05 11:43:15,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:15,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:15,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:15,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:15,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:16,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:16,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:16,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:16,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 11:43:16,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:16,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:43:16,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:16,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:16,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-05 11:43:16,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:43:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:43:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:43:16,232 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 13 states. [2019-09-05 11:43:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:16,413 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-05 11:43:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:43:16,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-05 11:43:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:16,414 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:43:16,414 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:43:16,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:43:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:43:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-05 11:43:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:43:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-05 11:43:16,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-05 11:43:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:16,419 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-05 11:43:16,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:43:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-05 11:43:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:43:16,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:16,420 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:16,420 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 10 times [2019-09-05 11:43:16,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:16,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:16,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:16,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:16,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:16,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:43:16,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:16,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:16,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:43:16,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:16,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:16,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:43:16,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:43:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:43:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:43:16,680 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 14 states. [2019-09-05 11:43:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:17,022 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-05 11:43:17,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:43:17,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-05 11:43:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:17,024 INFO L225 Difference]: With dead ends: 39 [2019-09-05 11:43:17,025 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:43:17,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:43:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:43:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-05 11:43:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:43:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 11:43:17,030 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-05 11:43:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:17,030 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 11:43:17,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:43:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 11:43:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:43:17,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:17,031 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:17,031 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:17,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1114266775, now seen corresponding path program 11 times [2019-09-05 11:43:17,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:17,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:17,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:17,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:17,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:17,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:17,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:17,223 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:43:46,911 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 11:43:46,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:47,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:43:47,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:47,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:47,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-05 11:43:47,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:43:47,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:43:47,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:43:47,079 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 15 states. [2019-09-05 11:43:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:47,316 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-05 11:43:47,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:43:47,317 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-05 11:43:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:47,318 INFO L225 Difference]: With dead ends: 41 [2019-09-05 11:43:47,318 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 11:43:47,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:43:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 11:43:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-05 11:43:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:43:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-05 11:43:47,324 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-05 11:43:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:47,324 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-05 11:43:47,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:43:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-05 11:43:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:43:47,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:47,326 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:47,326 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1856121196, now seen corresponding path program 12 times [2019-09-05 11:43:47,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:47,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:47,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:47,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:47,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:47,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:47,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:43:47,752 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:43:47,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:47,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:43:47,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:47,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:47,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-05 11:43:47,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:43:47,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:43:47,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:43:47,796 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 16 states. [2019-09-05 11:43:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:48,055 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-05 11:43:48,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:43:48,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 11:43:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:48,056 INFO L225 Difference]: With dead ends: 43 [2019-09-05 11:43:48,057 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 11:43:48,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:43:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 11:43:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-05 11:43:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:43:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-05 11:43:48,062 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-05 11:43:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:48,063 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-05 11:43:48,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:43:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-05 11:43:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:43:48,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:48,063 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:48,064 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:48,064 INFO L82 PathProgramCache]: Analyzing trace with hash -245709487, now seen corresponding path program 13 times [2019-09-05 11:43:48,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:48,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:48,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:48,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:48,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:48,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:48,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:48,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:43:48,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:48,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:48,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:43:48,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:43:48,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:43:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:43:48,373 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 17 states. [2019-09-05 11:43:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:48,683 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 11:43:48,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:43:48,683 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-05 11:43:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:48,684 INFO L225 Difference]: With dead ends: 45 [2019-09-05 11:43:48,684 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 11:43:48,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:43:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 11:43:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-05 11:43:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:43:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-05 11:43:48,688 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-05 11:43:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:48,689 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-05 11:43:48,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:43:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-05 11:43:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:43:48,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:48,690 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:48,690 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:48,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1171716302, now seen corresponding path program 14 times [2019-09-05 11:43:48,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:48,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:48,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:48,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:48,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:48,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:48,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:48,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:48,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:48,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:48,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:43:48,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:48,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:48,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-05 11:43:48,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:43:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:43:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:43:48,997 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 18 states. [2019-09-05 11:43:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:49,322 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-05 11:43:49,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:43:49,323 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-05 11:43:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:49,324 INFO L225 Difference]: With dead ends: 47 [2019-09-05 11:43:49,324 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:43:49,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:43:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:43:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-05 11:43:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:43:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-05 11:43:49,329 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-05 11:43:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:49,330 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-05 11:43:49,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:43:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-05 11:43:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:43:49,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:49,331 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:49,331 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1813266699, now seen corresponding path program 15 times [2019-09-05 11:43:49,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:49,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:49,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:49,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:49,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:49,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:49,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:43:49,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 11:43:49,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:49,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:43:49,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:49,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:49,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-05 11:43:49,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:43:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:43:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:43:49,890 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 19 states. [2019-09-05 11:43:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:50,276 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-05 11:43:50,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:43:50,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-05 11:43:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:50,277 INFO L225 Difference]: With dead ends: 49 [2019-09-05 11:43:50,277 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 11:43:50,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 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-05 11:43:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 11:43:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-05 11:43:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 11:43:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-05 11:43:50,282 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-05 11:43:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:50,282 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-05 11:43:50,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:43:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-05 11:43:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 11:43:50,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:50,283 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:50,284 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash -132092408, now seen corresponding path program 16 times [2019-09-05 11:43:50,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:50,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:50,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:50,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:50,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:50,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:50,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:50,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:50,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:50,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:50,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:43:50,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:43:50,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:50,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:43:50,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:43:50,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:43:50,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:43:50,673 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 20 states. [2019-09-05 11:43:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:51,077 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-05 11:43:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:43:51,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 11:43:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:51,078 INFO L225 Difference]: With dead ends: 51 [2019-09-05 11:43:51,078 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 11:43:51,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:43:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 11:43:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-05 11:43:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 11:43:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-05 11:43:51,084 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-05 11:43:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:51,084 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-05 11:43:51,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:43:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-05 11:43:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:43:51,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:51,085 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:51,085 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1311420475, now seen corresponding path program 17 times [2019-09-05 11:43:51,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:51,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:51,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:51,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:51,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:51,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:51,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:51,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:44:48,228 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-05 11:44:48,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:44:48,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:44:48,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:44:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:44:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-05 11:44:48,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:44:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:44:48,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:44:48,320 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 21 states. [2019-09-05 11:44:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:44:48,777 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-05 11:44:48,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:44:48,778 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-05 11:44:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:44:48,778 INFO L225 Difference]: With dead ends: 53 [2019-09-05 11:44:48,778 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 11:44:48,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 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-05 11:44:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 11:44:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-05 11:44:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 11:44:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-05 11:44:48,783 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-05 11:44:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:44:48,783 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-05 11:44:48,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:44:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-05 11:44:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:44:48,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:44:48,784 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:44:48,784 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:44:48,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:44:48,784 INFO L82 PathProgramCache]: Analyzing trace with hash -774326718, now seen corresponding path program 18 times [2019-09-05 11:44:48,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:44:48,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:44:48,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:48,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:44:48,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:49,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:49,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:44:49,188 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:44:51,052 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 11:44:51,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:44:51,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:44:51,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:44:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:51,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:44:51,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-05 11:44:51,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:44:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:44:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:44:51,116 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2019-09-05 11:44:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:44:51,631 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-05 11:44:51,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:44:51,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-05 11:44:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:44:51,632 INFO L225 Difference]: With dead ends: 55 [2019-09-05 11:44:51,633 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 11:44:51,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:44:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 11:44:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-05 11:44:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 11:44:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-05 11:44:51,637 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-05 11:44:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:44:51,638 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-05 11:44:51,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:44:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-05 11:44:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:44:51,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:44:51,639 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:44:51,639 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:44:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:44:51,639 INFO L82 PathProgramCache]: Analyzing trace with hash -23301761, now seen corresponding path program 19 times [2019-09-05 11:44:51,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:44:51,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:44:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:51,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:44:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:51,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:51,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:44:52,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:44:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:52,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:44:52,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:44:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:52,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:44:52,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:44:52,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:44:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:44:52,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:44:52,106 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 23 states. [2019-09-05 11:44:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:44:52,695 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-05 11:44:52,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:44:52,695 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-05 11:44:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:44:52,696 INFO L225 Difference]: With dead ends: 57 [2019-09-05 11:44:52,696 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 11:44:52,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:44:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 11:44:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-05 11:44:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 11:44:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-05 11:44:52,703 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-05 11:44:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:44:52,703 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-05 11:44:52,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:44:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-05 11:44:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:44:52,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:44:52,704 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:44:52,704 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:44:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:44:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 157176188, now seen corresponding path program 20 times [2019-09-05 11:44:52,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:44:52,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:44:52,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:52,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:44:52,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:53,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:53,201 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-05 11:44:53,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:44:53,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:44:53,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:44:53,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:44:53,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:44:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:53,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:44:53,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-05 11:44:53,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:44:53,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:44:53,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:44:53,294 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-09-05 11:44:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:44:53,907 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-05 11:44:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:44:53,909 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 11:44:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:44:53,910 INFO L225 Difference]: With dead ends: 59 [2019-09-05 11:44:53,910 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 11:44:53,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:44:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 11:44:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-05 11:44:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 11:44:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-05 11:44:53,913 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-05 11:44:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:44:53,914 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-05 11:44:53,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:44:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-05 11:44:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 11:44:53,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:44:53,914 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:44:53,915 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:44:53,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:44:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1797793337, now seen corresponding path program 21 times [2019-09-05 11:44:53,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:44:53,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:44:53,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:53,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:44:53,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:54,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:54,434 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) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:44:54,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:45:10,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-05 11:45:10,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:10,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:45:10,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:45:10,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:10,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-05 11:45:10,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:45:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:45:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:45:10,241 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 25 states. [2019-09-05 11:45:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:10,902 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-05 11:45:10,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:45:10,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-05 11:45:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:10,903 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:45:10,903 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 11:45:10,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 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-05 11:45:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 11:45:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-05 11:45:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 11:45:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-05 11:45:10,907 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-05 11:45:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:10,908 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-05 11:45:10,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:45:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-05 11:45:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:45:10,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:10,908 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:10,909 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 22 times [2019-09-05 11:45:10,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:10,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:10,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:10,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:10,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:45:11,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:11,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:45:11,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:45:11,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:45:11,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:11,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:45:11,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:45:11,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:11,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-05 11:45:11,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:45:11,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:45:11,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:45:11,421 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 26 states. [2019-09-05 11:45:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:12,155 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-05 11:45:12,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:45:12,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-05 11:45:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:12,157 INFO L225 Difference]: With dead ends: 63 [2019-09-05 11:45:12,157 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 11:45:12,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:45:12,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 11:45:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-05 11:45:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 11:45:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-05 11:45:12,162 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-05 11:45:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:12,162 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-05 11:45:12,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:45:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-05 11:45:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 11:45:12,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:12,163 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:12,163 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:12,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:12,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1929974285, now seen corresponding path program 23 times [2019-09-05 11:45:12,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:12,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:12,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:12,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:12,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:45:12,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:12,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:45:12,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:47:11,316 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-05 11:47:11,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:11,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:47:11,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:11,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:11,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-05 11:47:11,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:47:11,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:47:11,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:47:11,481 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 27 states. [2019-09-05 11:47:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:12,256 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-05 11:47:12,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:47:12,257 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-05 11:47:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:12,258 INFO L225 Difference]: With dead ends: 65 [2019-09-05 11:47:12,258 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 11:47:12,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:47:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 11:47:12,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-05 11:47:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 11:47:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-05 11:47:12,262 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-05 11:47:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:12,262 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-05 11:47:12,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:47:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-05 11:47:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 11:47:12,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:12,263 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:12,263 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1795916016, now seen corresponding path program 24 times [2019-09-05 11:47:12,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:12,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:12,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:12,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:12,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:47:12,753 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:47:44,438 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 11:47:44,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:44,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 11:47:44,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:44,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:44,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-05 11:47:44,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:47:44,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:47:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:47:44,572 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 28 states. [2019-09-05 11:47:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:45,405 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-05 11:47:45,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:47:45,406 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 11:47:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:45,407 INFO L225 Difference]: With dead ends: 67 [2019-09-05 11:47:45,407 INFO L226 Difference]: Without dead ends: 62 [2019-09-05 11:47:45,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:47:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-05 11:47:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-05 11:47:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-05 11:47:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-05 11:47:45,412 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-05 11:47:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:45,412 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-05 11:47:45,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:47:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-05 11:47:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 11:47:45,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:45,412 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:45,413 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash 373770413, now seen corresponding path program 25 times [2019-09-05 11:47:45,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:45,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:45,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:45,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:45,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:45,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:45,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 11:47:45,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:47:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:45,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 11:47:45,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:45,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:45,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-05 11:47:45,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:47:45,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:47:45,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:47:45,980 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 29 states. [2019-09-05 11:47:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:46,899 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-05 11:47:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:47:46,900 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-05 11:47:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:46,901 INFO L225 Difference]: With dead ends: 69 [2019-09-05 11:47:46,901 INFO L226 Difference]: Without dead ends: 64 [2019-09-05 11:47:46,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:47:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-05 11:47:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-05 11:47:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 11:47:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-05 11:47:46,906 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-05 11:47:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:46,906 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-05 11:47:46,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:47:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-05 11:47:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 11:47:46,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:46,907 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:46,907 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash -508553942, now seen corresponding path program 26 times [2019-09-05 11:47:46,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:46,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:46,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:46,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:47:46,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:47,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:47,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:47:47,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:47:47,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:47:47,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:47,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 11:47:47,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:47,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:47,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-05 11:47:47,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:47:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:47:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:47:47,507 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 30 states. [2019-09-05 11:47:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:48,504 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-05 11:47:48,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:47:48,505 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-05 11:47:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:48,506 INFO L225 Difference]: With dead ends: 71 [2019-09-05 11:47:48,506 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 11:47:48,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:47:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 11:47:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-05 11:47:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 11:47:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-05 11:47:48,511 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-05 11:47:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:48,511 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-05 11:47:48,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:47:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-05 11:47:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 11:47:48,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:48,512 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:48,512 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1981265511, now seen corresponding path program 27 times [2019-09-05 11:47:48,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:48,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:48,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:48,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:49,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:49,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:47:49,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:05,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-05 11:49:05,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:06,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:49:06,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:06,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:06,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-05 11:49:06,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:49:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:49:06,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:49:06,535 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 31 states. [2019-09-05 11:49:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:07,575 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-05 11:49:07,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:49:07,575 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-05 11:49:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:07,576 INFO L225 Difference]: With dead ends: 73 [2019-09-05 11:49:07,576 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 11:49:07,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:49:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 11:49:07,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-05 11:49:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 11:49:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-05 11:49:07,581 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-05 11:49:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:07,581 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-05 11:49:07,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:49:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-05 11:49:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 11:49:07,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:07,582 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:07,582 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1893991324, now seen corresponding path program 28 times [2019-09-05 11:49:07,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:07,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:07,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:08,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:08,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:49:08,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:49:08,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:08,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 11:49:08,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:08,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:08,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-05 11:49:08,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:49:08,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:49:08,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:49:08,282 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 32 states. [2019-09-05 11:49:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:09,435 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-05 11:49:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:49:09,435 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 11:49:09,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:09,436 INFO L225 Difference]: With dead ends: 75 [2019-09-05 11:49:09,436 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 11:49:09,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:49:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 11:49:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-05 11:49:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 11:49:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-05 11:49:09,441 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-05 11:49:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:09,442 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-05 11:49:09,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:49:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-05 11:49:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 11:49:09,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:09,442 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:09,443 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2015803169, now seen corresponding path program 29 times [2019-09-05 11:49:09,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:09,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:09,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:10,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:10,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:10,135 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:52:18,112 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-05 11:52:18,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:52:18,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 11:52:18,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:52:18,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:18,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-05 11:52:18,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:52:18,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:52:18,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:52:18,363 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 33 states. [2019-09-05 11:52:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:19,590 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-05 11:52:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:52:19,596 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2019-09-05 11:52:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:19,597 INFO L225 Difference]: With dead ends: 77 [2019-09-05 11:52:19,597 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 11:52:19,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:52:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 11:52:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-05 11:52:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 11:52:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-05 11:52:19,601 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-05 11:52:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:19,601 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-05 11:52:19,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:52:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-05 11:52:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 11:52:19,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:19,602 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:19,603 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1231926942, now seen corresponding path program 30 times [2019-09-05 11:52:19,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:19,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:19,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:19,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:52:19,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:52:20,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:20,309 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-05 11:52:20,322 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:54:21,866 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-05 11:54:21,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:22,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 11:54:22,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:22,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:22,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-05 11:54:22,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:54:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:54:22,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:54:22,123 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 34 states. [2019-09-05 11:54:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:23,433 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-05 11:54:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:54:23,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-05 11:54:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:23,434 INFO L225 Difference]: With dead ends: 79 [2019-09-05 11:54:23,435 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 11:54:23,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:54:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 11:54:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-05 11:54:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 11:54:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-05 11:54:23,440 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-05 11:54:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:23,441 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-05 11:54:23,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:54:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-05 11:54:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 11:54:23,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:23,442 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:23,442 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash -453850405, now seen corresponding path program 31 times [2019-09-05 11:54:23,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:23,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:23,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:24,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:24,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:54:24,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:54:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:24,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 11:54:24,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:24,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:24,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-05 11:54:24,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:54:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:54:24,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:54:24,164 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 35 states. [2019-09-05 11:54:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:25,544 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-05 11:54:25,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:54:25,545 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-05 11:54:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:25,546 INFO L225 Difference]: With dead ends: 81 [2019-09-05 11:54:25,546 INFO L226 Difference]: Without dead ends: 76 [2019-09-05 11:54:25,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:54:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-05 11:54:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-05 11:54:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 11:54:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-05 11:54:25,550 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-05 11:54:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:25,551 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-05 11:54:25,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:54:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-05 11:54:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 11:54:25,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:25,551 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:25,552 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1283210280, now seen corresponding path program 32 times [2019-09-05 11:54:25,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:25,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:25,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:25,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:54:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:26,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:26,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:54:26,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:54:26,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:54:26,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:26,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-05 11:54:26,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:26,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:26,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-05 11:54:26,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:54:26,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:54:26,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:54:26,341 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 36 states. [2019-09-05 11:54:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:27,797 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-05 11:54:27,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:54:27,799 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-05 11:54:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:27,800 INFO L225 Difference]: With dead ends: 83 [2019-09-05 11:54:27,800 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 11:54:27,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 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-05 11:54:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 11:54:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-05 11:54:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 11:54:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-05 11:54:27,804 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-05 11:54:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:27,804 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-05 11:54:27,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:54:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-05 11:54:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 11:54:27,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:27,805 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:27,806 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash 565866901, now seen corresponding path program 33 times [2019-09-05 11:54:27,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:27,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:27,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:27,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:27,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:28,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:28,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:54:28,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:55:17,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-05 11:55:17,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:55:17,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 11:55:17,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:55:17,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:17,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-05 11:55:17,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 11:55:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 11:55:17,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:55:17,222 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 37 states. [2019-09-05 11:55:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:18,806 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-05 11:55:18,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 11:55:18,806 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-09-05 11:55:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:18,808 INFO L225 Difference]: With dead ends: 85 [2019-09-05 11:55:18,808 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 11:55:18,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 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-05 11:55:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 11:55:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-05 11:55:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 11:55:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-05 11:55:18,814 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-05 11:55:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:18,814 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-05 11:55:18,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 11:55:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-05 11:55:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 11:55:18,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:18,815 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:18,815 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash -587422702, now seen corresponding path program 34 times [2019-09-05 11:55:18,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:18,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:18,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:18,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:55:18,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:55:19,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:19,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:55:19,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:55:19,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:55:19,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:55:19,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 11:55:19,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:55:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:55:19,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:55:19,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-05 11:55:19,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:55:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:55:19,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:55:19,706 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 38 states. [2019-09-05 11:55:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:55:21,356 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-05 11:55:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:55:21,357 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 78 [2019-09-05 11:55:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:55:21,358 INFO L225 Difference]: With dead ends: 87 [2019-09-05 11:55:21,358 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 11:55:21,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:55:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 11:55:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-05 11:55:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-05 11:55:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-05 11:55:21,364 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-05 11:55:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:55:21,364 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-05 11:55:21,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:55:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-05 11:55:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 11:55:21,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:55:21,366 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:55:21,366 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:55:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:55:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash -797168817, now seen corresponding path program 35 times [2019-09-05 11:55:21,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:55:21,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:55:21,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:21,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:55:21,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:55:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:55:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:55:22,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:55:22,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:55:22,172 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1