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/const_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:33:21,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:33:21,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:33:21,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:33:21,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:33:21,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:33:21,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:33:21,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:33:21,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:33:21,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:33:21,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:33:21,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:33:21,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:33:21,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:33:21,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:33:21,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:33:21,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:33:21,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:33:21,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:33:21,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:33:21,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:33:21,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:33:21,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:33:21,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:33:21,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:33:21,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:33:21,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:33:21,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:33:21,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:33:21,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:33:21,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:33:21,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:33:21,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:33:21,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:33:21,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:33:21,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:33:21,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:33:21,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:33:21,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:33:21,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:33:21,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:33:21,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:33:21,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:33:21,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:33:21,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:33:21,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:33:21,114 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:33:21,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:33:21,114 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:33:21,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:33:21,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:33:21,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:33:21,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:33:21,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:33:21,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:33:21,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:33:21,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:33:21,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:33:21,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:33:21,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:33:21,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:33:21,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:33:21,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:33:21,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:33:21,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:33:21,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:33:21,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:33:21,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:33:21,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:33:21,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:33:21,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:33:21,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:33:21,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:33:21,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:33:21,186 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:33:21,186 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:33:21,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c [2019-09-03 19:33:21,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87e50b39/1da36edaa7c44218b2447abdc7fc335f/FLAG2f597fd13 [2019-09-03 19:33:21,731 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:33:21,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c [2019-09-03 19:33:21,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87e50b39/1da36edaa7c44218b2447abdc7fc335f/FLAG2f597fd13 [2019-09-03 19:33:22,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87e50b39/1da36edaa7c44218b2447abdc7fc335f [2019-09-03 19:33:22,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:33:22,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:33:22,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:33:22,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:33:22,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:33:22,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b4c1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22, skipping insertion in model container [2019-09-03 19:33:22,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,177 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:33:22,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:33:22,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:33:22,370 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:33:22,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:33:22,408 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:33:22,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22 WrapperNode [2019-09-03 19:33:22,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:33:22,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:33:22,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:33:22,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:33:22,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (1/1) ... [2019-09-03 19:33:22,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:33:22,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:33:22,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:33:22,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:33:22,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:33:22,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:33:22,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:33:22,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:33:22,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:33:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:33:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:33:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:33:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:33:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:33:22,755 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:33:22,756 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:33:22,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:33:22 BoogieIcfgContainer [2019-09-03 19:33:22,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:33:22,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:33:22,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:33:22,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:33:22,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:33:22" (1/3) ... [2019-09-03 19:33:22,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5583df91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:33:22, skipping insertion in model container [2019-09-03 19:33:22,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:33:22" (2/3) ... [2019-09-03 19:33:22,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5583df91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:33:22, skipping insertion in model container [2019-09-03 19:33:22,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:33:22" (3/3) ... [2019-09-03 19:33:22,764 INFO L109 eAbstractionObserver]: Analyzing ICFG const_1-2.c [2019-09-03 19:33:22,774 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:33:22,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:33:22,800 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:33:22,829 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:33:22,830 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:33:22,830 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:33:22,830 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:33:22,830 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:33:22,831 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:33:22,831 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:33:22,831 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:33:22,831 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:33:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-03 19:33:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:33:22,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:22,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:22,862 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:22,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-03 19:33:22,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:22,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:22,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:22,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:33:22,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:23,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:33:23,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:33:23,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:33:23,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:33:23,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:33:23,074 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-03 19:33:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:23,124 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-03 19:33:23,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:33:23,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:33:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:23,135 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:33:23,135 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:33:23,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:33:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:33:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:33:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:33:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 19:33:23,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 19:33:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:23,190 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 19:33:23,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:33:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 19:33:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 19:33:23,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:23,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:23,191 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-03 19:33:23,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:23,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:33:23,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:23,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:23,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:33:23,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:23,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:33:23,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:23,397 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): Broken pipe [2019-09-03 19:33:23,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:23,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:33:23,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:33:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:33:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:33:23,406 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-03 19:33:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:23,439 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 19:33:23,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:33:23,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-03 19:33:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:23,441 INFO L225 Difference]: With dead ends: 18 [2019-09-03 19:33:23,442 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 19:33:23,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:33:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 19:33:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 19:33:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 19:33:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 19:33:23,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-03 19:33:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:23,448 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 19:33:23,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:33:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 19:33:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:33:23,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:23,449 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:23,449 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-03 19:33:23,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:33:23,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:23,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:23,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:23,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:33:23,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:33:23,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:23,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:33:23,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:23,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:23,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:33:23,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:33:23,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:33:23,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:33:23,622 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-03 19:33:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:23,662 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 19:33:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:33:23,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 19:33:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:23,664 INFO L225 Difference]: With dead ends: 19 [2019-09-03 19:33:23,664 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:33:23,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:33:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:33:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 19:33:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:33:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 19:33:23,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-03 19:33:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:23,669 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 19:33:23,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:33:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 19:33:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:33:23,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:23,670 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:23,671 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-03 19:33:23,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:23,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:23,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:23,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:23,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:23,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:33:23,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:23,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:33:23,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:23,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:33:23,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:23,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:23,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:33:23,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:33:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:33:23,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:33:23,870 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-03 19:33:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:23,906 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 19:33:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:33:23,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 19:33:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:23,908 INFO L225 Difference]: With dead ends: 20 [2019-09-03 19:33:23,908 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 19:33:23,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:33:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 19:33:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 19:33:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:33:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 19:33:23,913 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-03 19:33:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:23,914 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 19:33:23,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:33:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 19:33:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:33:23,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:23,915 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:23,915 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-03 19:33:23,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:23,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:23,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:24,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:24,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:33:24,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:24,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:33:24,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:24,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:33:24,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:24,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:24,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:33:24,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:33:24,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:33:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:33:24,161 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-03 19:33:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:24,231 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 19:33:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:33:24,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-03 19:33:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:24,235 INFO L225 Difference]: With dead ends: 21 [2019-09-03 19:33:24,235 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:33:24,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:33:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:33:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 19:33:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 19:33:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 19:33:24,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-03 19:33:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:24,243 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 19:33:24,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:33:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 19:33:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:33:24,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:24,245 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:24,245 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:24,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-03 19:33:24,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:24,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:24,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:24,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:24,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:24,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:24,413 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:33:24,430 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:33:24,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:24,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:33:24,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:24,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:24,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:33:24,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:33:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:33:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:33:24,474 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-03 19:33:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:24,528 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 19:33:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:33:24,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-03 19:33:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:24,529 INFO L225 Difference]: With dead ends: 22 [2019-09-03 19:33:24,530 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:33:24,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:33:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:33:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:33:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:33:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 19:33:24,535 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-03 19:33:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:24,535 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 19:33:24,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:33:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 19:33:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:33:24,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:24,536 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:24,537 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-03 19:33:24,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:24,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:24,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:24,650 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-03 19:33:24,671 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:33:24,685 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:33:24,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:24,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:33:24,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:24,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:24,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:33:24,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:33:24,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:33:24,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:33:24,728 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-03 19:33:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:24,801 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 19:33:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:33:24,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 19:33:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:24,802 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:33:24,803 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:33:24,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:33:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:33:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 19:33:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 19:33:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-03 19:33:24,808 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-03 19:33:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:24,808 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-03 19:33:24,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:33:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-03 19:33:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:33:24,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:24,810 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:24,810 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-03 19:33:24,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:24,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:24,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:24,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:24,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:33:25,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:25,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:33:25,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:25,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:25,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:33:25,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:33:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:33:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:33:25,066 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-03 19:33:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:25,142 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 19:33:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:33:25,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-03 19:33:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:25,144 INFO L225 Difference]: With dead ends: 24 [2019-09-03 19:33:25,144 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:33:25,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:33:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:33:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 19:33:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:33:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:33:25,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-03 19:33:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:25,157 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:33:25,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:33:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:33:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:33:25,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:25,158 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:25,158 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:25,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:25,158 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-03 19:33:25,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:25,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:25,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:25,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:33:25,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:25,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:25,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:33:25,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:25,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:33:25,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:25,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:33:25,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:25,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:25,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:33:25,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:33:25,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:33:25,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:33:25,464 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-03 19:33:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:25,571 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 19:33:25,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:33:25,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-03 19:33:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:25,573 INFO L225 Difference]: With dead ends: 25 [2019-09-03 19:33:25,573 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:33:25,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:33:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:33:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 19:33:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 19:33:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-03 19:33:25,578 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-03 19:33:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:25,578 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-03 19:33:25,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:33:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-03 19:33:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:33:25,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:25,579 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:25,579 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-03 19:33:25,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:25,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:25,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:25,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:25,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:33:25,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:25,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:33:25,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:25,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:33:25,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:25,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:25,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:33:25,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:33:25,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:33:25,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:33:25,913 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-03 19:33:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:26,025 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 19:33:26,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:33:26,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-03 19:33:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:26,027 INFO L225 Difference]: With dead ends: 26 [2019-09-03 19:33:26,027 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 19:33:26,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:33:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 19:33:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 19:33:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:33:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 19:33:26,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-03 19:33:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:26,036 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 19:33:26,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:33:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 19:33:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:33:26,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:26,038 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:26,038 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-03 19:33:26,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:26,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:26,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:26,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:26,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:26,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:33:26,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:33:26,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:26,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:33:26,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:33:26,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:33:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:33:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:33:26,290 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-03 19:33:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:26,413 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 19:33:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:33:26,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-03 19:33:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:26,415 INFO L225 Difference]: With dead ends: 27 [2019-09-03 19:33:26,415 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:33:26,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:33:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:33:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:33:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:33:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-03 19:33:26,426 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-03 19:33:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:26,426 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-03 19:33:26,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:33:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-03 19:33:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:33:26,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:26,427 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:26,428 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-03 19:33:26,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:26,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:26,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:26,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:26,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:26,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:26,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:33:26,650 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:26,718 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:33:26,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:26,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:33:26,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:26,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:33:26,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:33:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:33:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:33:26,764 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-03 19:33:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:26,894 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 19:33:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:33:26,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-03 19:33:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:26,897 INFO L225 Difference]: With dead ends: 28 [2019-09-03 19:33:26,897 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:33:26,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:33:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:33:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 19:33:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:33:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 19:33:26,905 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-03 19:33:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:26,905 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 19:33:26,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:33:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 19:33:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:33:26,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:26,907 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:26,908 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:26,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-03 19:33:26,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:26,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:27,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:27,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:27,146 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:33:27,194 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:33:27,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:27,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:33:27,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:27,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:27,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:33:27,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:33:27,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:33:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:33:27,240 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-03 19:33:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:27,371 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 19:33:27,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:33:27,371 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-03 19:33:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:27,372 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:33:27,372 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:33:27,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:33:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:33:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 19:33:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:33:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-03 19:33:27,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-03 19:33:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:27,378 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-03 19:33:27,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:33:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-03 19:33:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:33:27,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:27,379 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:27,379 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:27,379 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-03 19:33:27,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:27,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:27,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:27,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:27,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:27,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:27,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:27,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:33:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:27,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:33:27,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:27,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:27,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:33:27,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:33:27,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:33:27,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:33:27,682 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-03 19:33:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:27,839 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 19:33:27,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:33:27,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-03 19:33:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:27,841 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:33:27,841 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:33:27,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:33:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:33:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 19:33:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:33:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 19:33:27,847 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-03 19:33:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:27,848 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 19:33:27,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:33:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 19:33:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:33:27,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:27,849 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:27,849 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:27,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:27,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-03 19:33:27,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:27,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:27,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:27,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:33:27,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:28,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:28,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:28,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:33:28,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:33:28,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:28,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:33:28,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:33:28,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:28,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:33:28,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:33:28,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:33:28,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:33:28,156 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-03 19:33:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:28,318 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 19:33:28,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:33:28,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-03 19:33:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:28,319 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:33:28,319 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:33:28,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:33:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:33:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 19:33:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:33:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-03 19:33:28,324 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-03 19:33:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:28,325 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-03 19:33:28,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:33:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-03 19:33:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:33:28,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:28,326 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:28,326 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:28,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:28,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-03 19:33:28,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:28,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:28,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:28,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:28,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:28,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:33:28,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:33:28,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:28,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:33:28,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:29,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:29,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 19:33:29,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:33:29,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:33:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:33:29,028 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-03 19:33:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:29,237 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 19:33:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:33:29,238 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-03 19:33:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:29,239 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:33:29,239 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:33:29,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:33:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:33:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 19:33:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:33:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 19:33:29,243 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-03 19:33:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:29,244 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 19:33:29,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:33:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 19:33:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:33:29,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:29,245 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:29,245 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:29,245 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-03 19:33:29,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:29,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:29,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:29,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:29,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:29,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:29,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:29,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:33:29,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:33:29,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:29,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:33:29,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:29,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:29,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:33:29,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:33:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:33:29,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:33:29,619 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-03 19:33:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:29,824 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 19:33:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:33:29,824 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-03 19:33:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:29,825 INFO L225 Difference]: With dead ends: 33 [2019-09-03 19:33:29,825 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:33:29,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:33:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:33:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 19:33:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 19:33:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-03 19:33:29,830 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-03 19:33:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:29,830 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-03 19:33:29,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:33:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-03 19:33:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:33:29,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:29,832 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:29,832 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:29,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-03 19:33:29,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:29,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:29,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:29,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:30,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:30,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:30,112 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:33:46,747 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:33:46,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:46,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:33:46,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:46,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:46,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:33:46,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:33:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:33:46,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:33:46,805 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-03 19:33:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:47,048 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 19:33:47,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:33:47,049 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-03 19:33:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:47,050 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:33:47,050 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:33:47,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:33:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:33:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 19:33:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:33:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 19:33:47,056 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-03 19:33:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:47,056 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 19:33:47,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:33:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 19:33:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:33:47,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:47,057 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:47,057 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:47,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:47,058 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-03 19:33:47,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:47,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:47,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:47,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:47,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:47,355 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:33:47,596 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:33:47,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:47,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:33:47,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:47,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:47,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:33:47,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:33:47,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:33:47,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:33:47,662 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-03 19:33:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:47,950 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 19:33:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:33:47,950 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-03 19:33:47,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:47,951 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:33:47,951 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:33:47,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:33:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:33:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 19:33:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:33:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-03 19:33:47,959 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-03 19:33:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:47,959 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-03 19:33:47,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:33:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-03 19:33:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:33:47,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:47,960 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:47,960 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-03 19:33:47,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:47,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:47,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:48,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:48,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:48,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:33:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:48,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:33:48,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:48,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:48,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:33:48,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:33:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:33:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:33:48,334 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-03 19:33:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:48,596 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 19:33:48,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:33:48,597 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-03 19:33:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:48,597 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:33:48,597 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:33:48,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:33:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:33:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 19:33:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:33:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 19:33:48,605 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-03 19:33:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:48,606 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 19:33:48,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:33:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 19:33:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:33:48,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:48,607 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:48,607 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-03 19:33:48,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:48,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:33:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:48,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:48,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:49,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:33:49,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:33:49,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:49,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:33:49,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:49,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:49,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:33:49,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:33:49,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:33:49,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:33:49,104 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-03 19:33:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:49,472 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 19:33:49,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:33:49,472 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-03 19:33:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:49,473 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:33:49,473 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:33:49,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:33:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:33:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 19:33:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:33:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-03 19:33:49,478 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-03 19:33:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:49,478 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-03 19:33:49,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:33:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-03 19:33:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:33:49,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:49,479 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:49,479 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:49,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:49,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-03 19:33:49,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:49,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:49,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:49,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:49,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:49,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:49,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:33:50,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:33:50,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:50,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:33:50,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:50,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:50,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 19:33:50,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:33:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:33:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:33:50,790 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-03 19:33:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:51,095 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 19:33:51,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:33:51,097 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-03 19:33:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:51,098 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:33:51,098 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:33:51,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:33:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:33:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:33:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:33:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 19:33:51,103 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-03 19:33:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:51,103 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 19:33:51,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:33:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 19:33:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:33:51,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:51,104 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:51,104 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-03 19:33:51,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:51,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:51,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:51,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:51,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:51,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:33:51,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:33:51,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:51,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:33:51,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:51,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:51,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:33:51,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:33:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:33:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:33:51,596 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-03 19:33:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:51,976 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 19:33:51,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:33:51,976 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-03 19:33:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:51,977 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:33:51,977 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:33:51,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:33:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:33:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 19:33:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:33:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-03 19:33:51,990 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-03 19:33:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:51,991 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-03 19:33:51,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:33:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-03 19:33:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:33:51,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:51,992 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:51,992 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:51,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:51,992 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-03 19:33:51,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:51,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:51,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:52,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:52,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:52,426 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:34:13,347 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:34:13,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:13,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:34:13,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:13,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:13,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:34:13,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:34:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:34:13,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:34:13,413 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-03 19:34:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:13,812 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 19:34:13,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:34:13,812 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-03 19:34:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:13,813 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:34:13,813 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:34:13,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:34:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:34:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 19:34:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:34:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 19:34:13,819 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-03 19:34:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:13,819 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 19:34:13,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:34:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 19:34:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:34:13,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:13,820 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:13,820 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:13,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-03 19:34:13,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:13,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:13,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:13,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:13,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:14,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:14,446 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) [2019-09-03 19:34:14,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:19,512 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:34:19,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:19,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:34:19,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:19,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:19,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:34:19,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:34:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:34:19,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:34:19,571 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-03 19:34:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:20,009 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 19:34:20,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:34:20,010 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-03 19:34:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:20,010 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:34:20,010 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:34:20,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:34:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:34:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-03 19:34:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 19:34:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-03 19:34:20,015 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-03 19:34:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:20,015 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-03 19:34:20,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:34:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-03 19:34:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 19:34:20,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:20,016 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:20,016 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-03 19:34:20,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:20,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:20,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:20,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:20,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:20,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:20,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:34:20,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:20,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:20,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:34:20,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:34:20,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:34:20,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:34:20,588 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-03 19:34:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:21,081 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 19:34:21,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:34:21,082 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-03 19:34:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:21,082 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:34:21,082 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:34:21,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:34:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:34:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 19:34:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:34:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 19:34:21,091 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-03 19:34:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:21,092 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 19:34:21,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:34:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 19:34:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:34:21,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:21,093 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:21,093 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-03 19:34:21,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:21,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:21,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:21,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:21,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:21,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:21,598 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-03 19:34:21,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:34:21,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:21,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:21,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:34:21,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:21,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:21,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 19:34:21,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:34:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:34:21,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:34:21,702 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-03 19:34:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:22,220 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 19:34:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:34:22,226 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-03 19:34:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:22,227 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:34:22,227 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:34:22,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:34:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:34:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 19:34:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 19:34:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-03 19:34:22,230 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-03 19:34:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:22,230 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-03 19:34:22,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:34:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-03 19:34:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:34:22,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:22,231 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:22,231 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:22,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-03 19:34:22,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:22,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:22,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:22,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:22,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:23,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:23,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:34:23,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:25,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:34:25,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:25,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:34:25,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:25,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:25,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-03 19:34:25,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:34:25,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:34:25,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:34:25,640 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-03 19:34:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:26,179 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 19:34:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:34:26,179 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-03 19:34:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:26,180 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:34:26,180 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:34:26,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:34:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:34:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 19:34:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:34:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 19:34:26,185 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-03 19:34:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:26,185 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 19:34:26,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:34:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 19:34:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:34:26,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:26,186 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:26,186 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-03 19:34:26,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:26,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:26,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:26,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:26,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:26,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:34:26,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:26,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:26,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:34:26,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:26,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:26,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 19:34:26,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:34:26,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:34:26,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:34:26,784 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-03 19:34:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:27,386 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 19:34:27,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:34:27,387 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-03 19:34:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:27,387 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:34:27,387 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:34:27,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:34:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:34:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 19:34:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:34:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-03 19:34:27,391 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-03 19:34:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:27,391 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-03 19:34:27,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:34:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-03 19:34:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:34:27,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:27,392 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:27,392 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:27,392 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-03 19:34:27,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:27,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:27,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:27,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:27,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:27,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:35:57,705 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:35:57,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:35:57,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 19:35:57,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:35:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:35:57,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:35:57,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-03 19:35:57,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:35:57,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:35:57,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:35:57,852 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-03 19:35:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:35:58,495 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 19:35:58,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:35:58,496 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-03 19:35:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:35:58,496 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:35:58,496 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:35:58,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:35:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:35:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 19:35:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:35:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 19:35:58,504 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-03 19:35:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:35:58,505 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 19:35:58,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:35:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 19:35:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:35:58,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:35:58,506 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:35:58,507 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:35:58,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:35:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-03 19:35:58,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:35:58,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:35:58,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:58,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:35:58,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:35:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:35:59,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:35:59,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:35:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:36:53,960 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:36:53,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:54,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 19:36:54,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:54,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:54,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-03 19:36:54,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:36:54,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:36:54,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:36:54,105 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-03 19:36:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:54,757 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 19:36:54,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:36:54,758 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-03 19:36:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:54,759 INFO L225 Difference]: With dead ends: 47 [2019-09-03 19:36:54,759 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:36:54,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:36:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:36:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 19:36:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:36:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-03 19:36:54,765 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-03 19:36:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:54,765 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-03 19:36:54,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:36:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-03 19:36:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:36:54,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:54,767 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:54,767 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:54,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:54,767 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-03 19:36:54,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:54,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:54,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:54,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:54,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:55,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:55,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:55,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:36:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:55,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 19:36:55,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:55,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:55,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-03 19:36:55,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:36:55,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:36:55,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:36:55,485 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-03 19:36:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:56,200 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 19:36:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:36:56,204 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-03 19:36:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:56,205 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:36:56,205 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:36:56,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:36:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:36:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 19:36:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:36:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 19:36:56,211 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-03 19:36:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:56,211 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 19:36:56,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:36:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 19:36:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:36:56,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:56,212 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:56,212 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-03 19:36:56,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:56,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:56,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:56,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:36:56,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:56,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:56,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:56,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:36:56,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:36:56,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:56,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 19:36:56,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:56,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:56,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-03 19:36:56,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:36:56,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:36:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:36:56,962 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-03 19:36:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:57,718 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 19:36:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:36:57,718 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-03 19:36:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:57,719 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:36:57,719 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:36:57,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:36:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:36:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 19:36:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:36:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 19:36:57,724 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-03 19:36:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:57,724 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 19:36:57,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:36:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 19:36:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:36:57,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:57,725 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:57,725 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-03 19:36:57,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:57,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:57,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:57,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:57,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:58,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:58,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:58,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:37:22,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 19:37:22,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:22,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:37:22,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:22,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-03 19:37:22,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:37:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:37:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:37:22,831 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-03 19:37:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:23,639 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 19:37:23,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:37:23,640 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-03 19:37:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:23,641 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:37:23,641 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:37:23,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:37:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:37:23,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 19:37:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:37:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 19:37:23,644 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-03 19:37:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:23,645 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 19:37:23,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:37:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 19:37:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:37:23,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:23,646 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:23,646 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:23,646 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-03 19:37:23,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:23,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:23,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:24,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:24,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:24,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:37:24,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:37:24,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:24,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:37:24,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:24,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:24,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-03 19:37:24,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:37:24,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:37:24,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:37:24,500 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-03 19:37:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:25,319 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-03 19:37:25,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:37:25,319 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-03 19:37:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:25,320 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:37:25,320 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:37:25,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:37:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:37:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 19:37:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:37:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-03 19:37:25,324 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-03 19:37:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:25,324 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-03 19:37:25,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:37:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-03 19:37:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:37:25,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:25,325 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:25,325 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-03 19:37:25,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:25,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:25,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:25,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:25,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:26,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:26,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:26,294 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:39:17,074 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 19:39:17,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:17,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 19:39:17,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:17,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:17,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-03 19:39:17,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:39:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:39:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:39:17,165 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-03 19:39:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:18,054 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-03 19:39:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:39:18,055 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-03 19:39:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:18,056 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:39:18,056 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:39:18,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:39:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:39:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 19:39:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:39:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 19:39:18,060 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-03 19:39:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:18,060 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 19:39:18,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:39:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 19:39:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:39:18,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:18,061 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:18,061 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:18,061 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 36 times [2019-09-03 19:39:18,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:18,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:18,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:18,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:18,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:18,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:18,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:18,824 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:39:48,246 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:39:48,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:48,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:39:48,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:48,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:48,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-03 19:39:48,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:39:48,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:39:48,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:39:48,371 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 40 states. [2019-09-03 19:39:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:49,276 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-03 19:39:49,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:39:49,277 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 46 [2019-09-03 19:39:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:49,278 INFO L225 Difference]: With dead ends: 53 [2019-09-03 19:39:49,278 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:39:49,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:39:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:39:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 19:39:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:39:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-09-03 19:39:49,282 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-09-03 19:39:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:49,282 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-09-03 19:39:49,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:39:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-09-03 19:39:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:39:49,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:49,283 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:49,283 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1227282577, now seen corresponding path program 37 times [2019-09-03 19:39:49,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:49,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:49,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:49,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:50,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:50,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:39:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:50,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 19:39:50,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:50,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:50,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-03 19:39:50,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:39:50,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:39:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:39:50,287 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 41 states. [2019-09-03 19:39:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:51,216 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-03 19:39:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:39:51,217 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-09-03 19:39:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:51,218 INFO L225 Difference]: With dead ends: 54 [2019-09-03 19:39:51,218 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:39:51,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:39:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:39:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-03 19:39:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:39:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 19:39:51,222 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-09-03 19:39:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:51,223 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 19:39:51,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:39:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 19:39:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:39:51,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:51,224 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:51,224 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash -572484514, now seen corresponding path program 38 times [2019-09-03 19:39:51,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:51,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:39:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:52,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:52,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:52,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:39:52,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:39:52,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:52,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 19:39:52,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:52,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:52,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-03 19:39:52,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:39:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:39:52,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:39:52,209 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 42 states. [2019-09-03 19:39:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:53,227 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-03 19:39:53,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:39:53,228 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 48 [2019-09-03 19:39:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:53,228 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:39:53,228 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:39:53,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:39:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:39:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-03 19:39:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:39:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-09-03 19:39:53,232 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-09-03 19:39:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:53,232 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-09-03 19:39:53,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:39:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-09-03 19:39:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:39:53,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:53,233 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:53,234 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:53,234 INFO L82 PathProgramCache]: Analyzing trace with hash -530689487, now seen corresponding path program 39 times [2019-09-03 19:39:53,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:53,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:53,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:53,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:53,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:39:54,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:54,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:54,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:40:32,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 19:40:32,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:32,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 19:40:32,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:32,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:32,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-03 19:40:32,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:40:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:40:32,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:40:32,306 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 43 states. [2019-09-03 19:40:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:33,375 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-03 19:40:33,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:40:33,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2019-09-03 19:40:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:33,376 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:40:33,377 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:40:33,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:40:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:40:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-03 19:40:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:40:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-03 19:40:33,382 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-09-03 19:40:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:33,382 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-03 19:40:33,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:40:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-03 19:40:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:40:33,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:33,383 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:33,383 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:33,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 764956350, now seen corresponding path program 40 times [2019-09-03 19:40:33,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:33,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:33,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:33,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:33,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:34,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:34,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:34,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:40:34,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:40:34,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:34,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 19:40:34,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:34,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:34,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-03 19:40:34,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:40:34,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:40:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:40:34,404 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 44 states. [2019-09-03 19:40:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:35,534 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-03 19:40:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:40:35,538 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 50 [2019-09-03 19:40:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:35,539 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:40:35,539 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:40:35,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:40:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:40:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-03 19:40:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:40:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-03 19:40:35,543 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-09-03 19:40:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:35,543 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-03 19:40:35,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:40:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-03 19:40:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:40:35,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:35,544 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:35,545 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:35,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2019695663, now seen corresponding path program 41 times [2019-09-03 19:40:35,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:35,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:35,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:35,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:35,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:40:36,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:36,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:36,499 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:43:03,194 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-03 19:43:03,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:43:03,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 19:43:03,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:43:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:03,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:03,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-03 19:43:03,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:43:03,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:43:03,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:43:03,462 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 45 states. [2019-09-03 19:43:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:04,605 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-03 19:43:04,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:43:04,605 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 51 [2019-09-03 19:43:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:04,606 INFO L225 Difference]: With dead ends: 58 [2019-09-03 19:43:04,607 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:43:04,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:43:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:43:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-09-03 19:43:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:43:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-03 19:43:04,610 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-09-03 19:43:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:04,610 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-03 19:43:04,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:43:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-03 19:43:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:43:04,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:43:04,611 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:43:04,612 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:43:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:43:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1850405150, now seen corresponding path program 42 times [2019-09-03 19:43:04,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:43:04,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:43:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:04,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:43:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:05,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:43:05,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:43:05,602 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:44:29,219 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-03 19:44:29,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:44:29,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:44:29,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:44:29,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:29,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-03 19:44:29,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:44:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:44:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:44:29,530 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 46 states. [2019-09-03 19:44:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:30,750 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-03 19:44:30,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:44:30,752 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2019-09-03 19:44:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:30,753 INFO L225 Difference]: With dead ends: 59 [2019-09-03 19:44:30,753 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:44:30,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:44:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:44:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-03 19:44:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:44:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-03 19:44:30,756 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-09-03 19:44:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:30,756 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-03 19:44:30,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:44:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-03 19:44:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:44:30,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:30,757 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:30,757 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1564446065, now seen corresponding path program 43 times [2019-09-03 19:44:30,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:30,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:30,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:44:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:44:31,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:31,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:44:31,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:31,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 19:44:31,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:44:32,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:32,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-03 19:44:32,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:44:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:44:32,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:44:32,016 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 47 states. [2019-09-03 19:44:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:33,249 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-03 19:44:33,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:44:33,249 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 53 [2019-09-03 19:44:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:33,250 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:44:33,250 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 19:44:33,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:44:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 19:44:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-03 19:44:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:44:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 19:44:33,253 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-09-03 19:44:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:33,254 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 19:44:33,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:44:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 19:44:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:44:33,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:33,254 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:33,254 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1289649022, now seen corresponding path program 44 times [2019-09-03 19:44:33,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:33,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:33,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:33,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:44:34,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:34,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:44:34,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:44:34,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:44:34,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:44:34,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 19:44:34,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:44:34,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-03 19:44:34,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:44:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:44:34,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:44:34,533 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 48 states. [2019-09-03 19:44:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:35,882 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-03 19:44:35,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:44:35,882 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2019-09-03 19:44:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:35,883 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:44:35,883 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:44:35,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:44:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:44:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-03 19:44:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 19:44:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-03 19:44:35,888 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-09-03 19:44:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:35,888 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-03 19:44:35,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:44:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-03 19:44:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:44:35,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:35,889 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:35,889 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:35,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1360875281, now seen corresponding path program 45 times [2019-09-03 19:44:35,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:35,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:35,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:35,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:44:35,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:44:37,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:37,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:44:37,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:45:04,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 19:45:04,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:45:04,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 19:45:04,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:45:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:45:04,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:45:04,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-03 19:45:04,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:45:04,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:45:04,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:45:04,964 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 49 states. [2019-09-03 19:45:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:45:06,342 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-03 19:45:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:45:06,343 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 55 [2019-09-03 19:45:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:45:06,344 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:45:06,344 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 19:45:06,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:45:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 19:45:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-03 19:45:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:45:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-03 19:45:06,348 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-09-03 19:45:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:45:06,348 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-03 19:45:06,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:45:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-03 19:45:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:45:06,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:45:06,349 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:45:06,349 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:45:06,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:45:06,349 INFO L82 PathProgramCache]: Analyzing trace with hash -726077986, now seen corresponding path program 46 times [2019-09-03 19:45:06,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:45:06,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:45:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:06,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:45:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:45:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:45:07,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:45:07,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:45:07,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:45:07,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:45:07,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:45:07,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 19:45:07,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:45:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:45:07,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:45:07,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-03 19:45:07,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:45:07,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:45:07,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:45:07,979 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 50 states. [2019-09-03 19:45:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:45:09,406 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-03 19:45:09,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:45:09,407 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56 [2019-09-03 19:45:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:45:09,408 INFO L225 Difference]: With dead ends: 63 [2019-09-03 19:45:09,408 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:45:09,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:45:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:45:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-03 19:45:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:45:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-03 19:45:09,413 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-09-03 19:45:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:45:09,413 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-03 19:45:09,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:45:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-03 19:45:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 19:45:09,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:45:09,414 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:45:09,414 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:45:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:45:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash -997119823, now seen corresponding path program 47 times [2019-09-03 19:45:09,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:45:09,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:45:09,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:09,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:45:09,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:45:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:45:10,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:45:10,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:45:10,642 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1